%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP407-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:39:34 PM UTC 2026
% Result : Unsatisfiable 2.10s 0.70s
% Output : CNFRefutation 2.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 2
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 9 RR)
% Number of literals : 32 ( 31 equ; 8 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),multiply(inverse(X2),multiply(inverse(X2),X2))))) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_0_2,axiom,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),multiply(inverse(X2),multiply(inverse(X2),X2))))) = X3,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(inverse(X2),multiply(inverse(X3),multiply(inverse(X3),X3))))) = inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,X3)),X4)),X2)),multiply(inverse(X4),multiply(inverse(X4),X4)))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),multiply(inverse(multiply(X1,X2)),X4))),multiply(inverse(X3),multiply(inverse(X3),X3)))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(multiply(inverse(X3),multiply(inverse(X2),multiply(inverse(X2),X2)))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))),multiply(inverse(X2),multiply(inverse(X2),X2)))) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_7,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(X4,X2)),multiply(X4,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(X1,multiply(inverse(X2),multiply(inverse(X2),X2)))),multiply(X1,X3)) = multiply(X4,multiply(inverse(multiply(inverse(multiply(X5,X2)),multiply(X5,X4))),X3)),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(multiply(inverse(multiply(X3,X4)),multiply(X3,multiply(inverse(X2),X2)))))) = multiply(inverse(X2),X4),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))),multiply(inverse(multiply(X4,X2)),X5)) = multiply(inverse(multiply(X6,multiply(X4,X3))),multiply(X6,X5)),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_11,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),multiply(inverse(multiply(X4,X2)),multiply(X4,X5))) = multiply(inverse(multiply(X6,X3)),multiply(X6,multiply(X1,X5))),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_12,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(X3)))),multiply(inverse(X2),multiply(inverse(X2),X2))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_8]),c_0_9]) ).
cnf(c_0_13,plain,
multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(X1,multiply(X2,X4))) = multiply(inverse(multiply(X5,multiply(X6,X3))),multiply(X5,multiply(X6,X4))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
multiply(inverse(multiply(b2,multiply(b2,multiply(inverse(X1),X1)))),multiply(b2,multiply(b2,multiply(inverse(X1),X1)))) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_13]) ).
cnf(c_0_15,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_17,plain,
inverse(multiply(inverse(multiply(inverse(X1),X1)),multiply(inverse(X2),multiply(inverse(X2),X2)))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
c_0_16 ).
cnf(c_0_19,plain,
inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(inverse(X2),X2)))) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_20,negated_conjecture,
multiply(multiply(inverse(X1),X1),a2) != a2,
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_21,plain,
inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(inverse(X3),X3)))) = X2,
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
multiply(multiply(X1,multiply(inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,X1))),multiply(inverse(X3),multiply(inverse(X3),X3)))),a2) != a2,
inference(spm,[status(thm)],[c_0_20,c_0_6]) ).
cnf(c_0_23,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(X2),X3),
inference(spm,[status(thm)],[c_0_5,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
multiply(multiply(X1,multiply(inverse(X1),multiply(inverse(X2),X2))),a2) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_23]),c_0_23]) ).
cnf(c_0_25,plain,
inverse(multiply(inverse(X1),multiply(inverse(X2),X2))) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
multiply(multiply(multiply(inverse(X1),X2),multiply(inverse(X2),X1)),a2) != a2,
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_27,plain,
inverse(multiply(inverse(X1),X1)) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_28,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
multiply(multiply(X1,multiply(multiply(inverse(b2),b2),inverse(X1))),a2) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_12]),c_0_23]),c_0_23]),c_0_27]) ).
cnf(c_0_30,plain,
multiply(multiply(inverse(b2),b2),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_28]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_27]),c_0_30]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP407-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n009.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 20:12:42 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.39 Running first-order theorem proving
% 0.09/0.39 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.10/0.70 % Version: 3.5.1
% 2.10/0.70 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.10/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.10/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.10/0.70 % Starting new_bool_3 with 300s (1) cores
% 2.10/0.70 % Starting new_bool_1 with 300s (1) cores
% 2.10/0.70 % Starting sh5l with 300s (1) cores
% 2.10/0.70 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4141128 completed with status 0
% 2.10/0.70 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.10/0.70 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.10/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.10/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.10/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.10/0.70 % No SInE strategy applied
% 2.10/0.70 % Search class: FUUPF-FFSF21-DFFFFFNN
% 2.10/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.10/0.70 % Starting SubtermCWHack with 136s (1) cores
% 2.10/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.10/0.70 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.10/0.70 % Starting new_bool_3 with 136s (1) cores
% 2.10/0.70 % Starting new_bool_1 with 136s (1) cores
% 2.10/0.70 % U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 4141136 completed with status 0
% 2.10/0.70 % Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 2.10/0.70 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.10/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.10/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.10/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.10/0.70 % No SInE strategy applied
% 2.10/0.70 % Search class: FUUPF-FFSF21-DFFFFFNN
% 2.10/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.10/0.70 % Starting SubtermCWHack with 136s (1) cores
% 2.10/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.10/0.70 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.10/0.70 % Preprocessing time : 0.001 s
% 2.10/0.70 % Presaturation interreduction done
% 2.10/0.70
% 2.10/0.70 % Proof found!
% 2.10/0.70 % SZS status Unsatisfiable
% 2.10/0.70 % SZS output start CNFRefutation
% See solution above
% 2.10/0.70 % Parsed axioms : 2
% 2.10/0.70 % Removed by relevancy pruning/SinE : 0
% 2.10/0.70 % Initial clauses : 2
% 2.10/0.70 % Removed in clause preprocessing : 0
% 2.10/0.70 % Initial clauses in saturation : 2
% 2.10/0.70 % Processed clauses : 334
% 2.10/0.70 % ...of these trivial : 21
% 2.10/0.70 % ...subsumed : 248
% 2.10/0.70 % ...remaining for further processing : 65
% 2.10/0.70 % Other redundant clauses eliminated : 0
% 2.10/0.70 % Clauses deleted for lack of memory : 0
% 2.10/0.70 % Backward-subsumed : 6
% 2.10/0.70 % Backward-rewritten : 36
% 2.10/0.70 % Generated clauses : 10328
% 2.10/0.70 % ...of the previous two non-redundant : 10115
% 2.10/0.70 % ...aggressively subsumed : 0
% 2.10/0.70 % Contextual simplify-reflections : 0
% 2.10/0.70 % Paramodulations : 10328
% 2.10/0.70 % Factorizations : 0
% 2.10/0.70 % NegExts : 0
% 2.10/0.70 % Equation resolutions : 0
% 2.10/0.70 % Disequality decompositions : 0
% 2.10/0.70 % Total rewrite steps : 2750
% 2.10/0.70 % ...of those cached : 1974
% 2.10/0.70 % Propositional unsat checks : 0
% 2.10/0.70 % Propositional check models : 0
% 2.10/0.70 % Propositional check unsatisfiable : 0
% 2.10/0.70 % Propositional clauses : 0
% 2.10/0.70 % Propositional clauses after purity: 0
% 2.10/0.70 % Propositional unsat core size : 0
% 2.10/0.70 % Propositional preprocessing time : 0.000
% 2.10/0.70 % Propositional encoding time : 0.000
% 2.10/0.70 % Propositional solver time : 0.000
% 2.10/0.70 % Success case prop preproc time : 0.000
% 2.10/0.70 % Success case prop encoding time : 0.000
% 2.10/0.70 % Success case prop solver time : 0.000
% 2.10/0.70 % Current number of processed clauses : 21
% 2.10/0.70 % Positive orientable unit clauses : 6
% 2.10/0.70 % Positive unorientable unit clauses: 1
% 2.10/0.70 % Negative unit clauses : 14
% 2.10/0.70 % Non-unit-clauses : 0
% 2.10/0.70 % Current number of unprocessed clauses: 9723
% 2.10/0.70 % ...number of literals in the above : 9723
% 2.10/0.70 % Current number of archived formulas : 0
% 2.10/0.70 % Current number of archived clauses : 44
% 2.10/0.70 % Clause-clause subsumption calls (NU) : 0
% 2.10/0.70 % Rec. Clause-clause subsumption calls : 0
% 2.10/0.70 % Non-unit clause-clause subsumptions : 0
% 2.10/0.70 % Unit Clause-clause subsumption calls : 144
% 2.10/0.70 % Rewrite failures with RHS unbound : 0
% 2.10/0.70 % BW rewrite match attempts : 564
% 2.10/0.70 % BW rewrite match successes : 65
% 2.10/0.70 % Condensation attempts : 0
% 2.10/0.70 % Condensation successes : 0
% 2.10/0.70 % Termbank termtop insertions : 472208
% 2.10/0.70 % Search garbage collected termcells : 2
% 2.10/0.70
% 2.10/0.70 % -------------------------------------------------
% 2.10/0.70 % User time : 0.238 s
% 2.10/0.70 % System time : 0.016 s
% 2.10/0.70 % Total time : 0.254 s
% 2.10/0.70 % Maximum resident set size: 3632 pages
% 2.10/0.70
% 2.10/0.70 % -------------------------------------------------
% 2.10/0.70 % User time : 1.003 s
% 2.10/0.70 % System time : 0.064 s
% 2.10/0.70 % Total time : 1.067 s
% 2.10/0.70 % Maximum resident set size: 4864 pages
% 2.10/0.70 % E exiting
%------------------------------------------------------------------------------