%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP203-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:38:58 PM UTC 2026
% Result : Unsatisfiable 12.89s 7.52s
% Output : CNFRefutation 12.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 4
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 5 RR)
% Number of literals : 43 ( 42 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(moufang3,axiom,
multiply(multiply(multiply(X1,X2),X1),X3) = multiply(X1,multiply(X2,multiply(X1,X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',moufang3) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
cnf(left_inverse,axiom,
multiply(left_inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
cnf(prove_moufang2,negated_conjecture,
multiply(multiply(multiply(a,b),c),b) != multiply(a,multiply(b,multiply(c,b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_moufang2) ).
cnf(c_0_4,axiom,
multiply(multiply(multiply(X1,X2),X1),X3) = multiply(X1,multiply(X2,multiply(X1,X3))),
moufang3 ).
cnf(c_0_5,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_6,plain,
multiply(multiply(X1,identity),X2) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_5]),c_0_5]) ).
cnf(c_0_7,axiom,
multiply(left_inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_8,plain,
multiply(left_inverse(identity),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_5]) ).
cnf(c_0_9,plain,
multiply(multiply(X1,left_inverse(identity)),X2) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_10,plain,
multiply(left_inverse(left_inverse(identity)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_7]),c_0_5]) ).
cnf(c_0_11,plain,
multiply(left_inverse(X1),multiply(X1,multiply(left_inverse(X1),X2))) = multiply(left_inverse(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_7]),c_0_5]) ).
cnf(c_0_12,plain,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_6]),c_0_5]) ).
cnf(c_0_13,plain,
left_inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_14,plain,
multiply(multiply(X1,multiply(X2,multiply(X1,identity))),X3) = multiply(X1,multiply(X2,multiply(X1,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_4]),c_0_4]) ).
cnf(c_0_15,plain,
multiply(left_inverse(X1),multiply(X1,identity)) = identity,
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_16,plain,
multiply(multiply(X1,multiply(X1,identity)),X2) = multiply(X1,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_13]),c_0_12]) ).
cnf(c_0_17,plain,
multiply(X1,multiply(left_inverse(X1),multiply(X1,X2))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_6]) ).
cnf(c_0_18,plain,
multiply(multiply(X1,multiply(X2,multiply(X2,multiply(X1,identity)))),X3) = multiply(X1,multiply(X2,multiply(X2,multiply(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_16]) ).
cnf(c_0_19,plain,
multiply(left_inverse(X1),multiply(left_inverse(left_inverse(X1)),identity)) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_20,plain,
multiply(left_inverse(left_inverse(X1)),multiply(left_inverse(X1),multiply(left_inverse(X1),multiply(left_inverse(left_inverse(X1)),X2)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15]),c_0_5]) ).
cnf(c_0_21,plain,
multiply(left_inverse(left_inverse(X1)),multiply(left_inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_22,plain,
multiply(X1,multiply(left_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_11]),c_0_21]) ).
cnf(c_0_23,plain,
multiply(multiply(multiply(X1,X2),multiply(X1,identity)),X3) = multiply(X1,multiply(X2,multiply(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_6]),c_0_6]),c_0_6]) ).
cnf(c_0_24,plain,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_7]) ).
cnf(c_0_25,plain,
multiply(multiply(X1,X2),X1) = multiply(X1,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_26,plain,
multiply(X1,multiply(multiply(left_inverse(X1),X2),X1)) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_27,plain,
multiply(left_inverse(left_inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_7]) ).
cnf(c_0_28,plain,
multiply(multiply(X1,left_inverse(X2)),X2) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_7]),c_0_24]),c_0_22]),c_0_24]) ).
cnf(c_0_29,plain,
left_inverse(left_inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_30,plain,
multiply(multiply(X1,X2),left_inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
multiply(left_inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_15]),c_0_5]),c_0_22]) ).
cnf(c_0_32,plain,
multiply(X1,left_inverse(multiply(X2,X1))) = left_inverse(X2),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
multiply(left_inverse(multiply(X1,X2)),X1) = left_inverse(X2),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_34,plain,
left_inverse(multiply(X1,left_inverse(X2))) = multiply(X2,left_inverse(X1)),
inference(spm,[status(thm)],[c_0_22,c_0_32]) ).
cnf(c_0_35,plain,
left_inverse(multiply(left_inverse(X1),X2)) = multiply(left_inverse(X2),X1),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_36,plain,
left_inverse(multiply(X1,multiply(X2,multiply(X1,left_inverse(X3))))) = multiply(X3,left_inverse(multiply(X1,multiply(X2,X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_23]),c_0_24]),c_0_25]) ).
cnf(c_0_37,plain,
multiply(left_inverse(X1),left_inverse(X2)) = left_inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
multiply(multiply(multiply(a,b),c),b) != multiply(a,multiply(b,multiply(c,b))),
inference(fof_simplification,[status(thm)],[prove_moufang2]) ).
cnf(c_0_39,plain,
multiply(multiply(multiply(X1,X2),left_inverse(X3)),X2) = multiply(X1,multiply(X2,multiply(left_inverse(X3),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_35]),c_0_34]),c_0_25]),c_0_37]),c_0_34]) ).
cnf(c_0_40,negated_conjecture,
multiply(multiply(multiply(a,b),c),b) != multiply(a,multiply(b,multiply(c,b))),
c_0_38 ).
cnf(c_0_41,plain,
multiply(multiply(multiply(X1,X2),X3),X2) = multiply(X1,multiply(X2,multiply(X3,X2))),
inference(spm,[status(thm)],[c_0_39,c_0_29]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP203-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42 % Computer : n011.cluster.edu
% 0.14/5.42 % Model : x86_64 x86_64
% 0.14/5.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.42 % Memory : 8046.5625MB
% 0.14/5.42 % OS : Linux 6.8.0-71-generic
% 0.14/5.42 % CPULimit : 300
% 0.14/5.42 % WCLimit : 300
% 0.14/5.42 % DateTime : Sun Sep 20 20:06:30 UTC 2026
% 0.14/5.43 % CPUTime :
% 0.14/5.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/5.50 Running first-order theorem proving
% 0.18/5.50 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
% 12.89/7.52 % Version: 3.5.1
% 12.89/7.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 12.89/7.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.89/7.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 12.89/7.52 % Starting new_bool_3 with 300s (1) cores
% 12.89/7.52 % Starting new_bool_1 with 300s (1) cores
% 12.89/7.52 % Starting sh5l with 300s (1) cores
% 12.89/7.52 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 57478 completed with status 0
% 12.89/7.52 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 12.89/7.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 12.89/7.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.89/7.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 12.89/7.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.89/7.52 % No SInE strategy applied
% 12.89/7.52 % Search class: FUUPS-FFSF21-MFFFFFNN
% 12.89/7.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 12.89/7.52 % Starting SubtermCWHack with 136s (1) cores
% 12.89/7.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 12.89/7.52 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 12.89/7.52 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 12.89/7.52 % Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 12.89/7.52 % G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 57481 completed with status 0
% 12.89/7.52 % Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 12.89/7.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 12.89/7.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.89/7.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 12.89/7.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.89/7.52 % No SInE strategy applied
% 12.89/7.52 % Search class: FUUPS-FFSF21-MFFFFFNN
% 12.89/7.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 12.89/7.52 % Starting SubtermCWHack with 136s (1) cores
% 12.89/7.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 12.89/7.52 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 12.89/7.52 % Preprocessing time : 0.002 s
% 12.89/7.52 % Presaturation interreduction done
% 12.89/7.52
% 12.89/7.52 % Proof found!
% 12.89/7.52 % SZS status Unsatisfiable
% 12.89/7.52 % SZS output start CNFRefutation
% See solution above
% 12.89/7.52 % Parsed axioms : 4
% 12.89/7.52 % Removed by relevancy pruning/SinE : 0
% 12.89/7.52 % Initial clauses : 4
% 12.89/7.52 % Removed in clause preprocessing : 0
% 12.89/7.52 % Initial clauses in saturation : 4
% 12.89/7.52 % Processed clauses : 553
% 12.89/7.52 % ...of these trivial : 383
% 12.89/7.52 % ...subsumed : 0
% 12.89/7.52 % ...remaining for further processing : 170
% 12.89/7.52 % Other redundant clauses eliminated : 0
% 12.89/7.52 % Clauses deleted for lack of memory : 0
% 12.89/7.52 % Backward-subsumed : 0
% 12.89/7.52 % Backward-rewritten : 45
% 12.89/7.52 % Generated clauses : 31335
% 12.89/7.52 % ...of the previous two non-redundant : 24574
% 12.89/7.52 % ...aggressively subsumed : 0
% 12.89/7.52 % Contextual simplify-reflections : 0
% 12.89/7.52 % Paramodulations : 31335
% 12.89/7.52 % Factorizations : 0
% 12.89/7.52 % NegExts : 0
% 12.89/7.52 % Equation resolutions : 0
% 12.89/7.52 % Disequality decompositions : 0
% 12.89/7.52 % Total rewrite steps : 166198
% 12.89/7.52 % ...of those cached : 153367
% 12.89/7.52 % Propositional unsat checks : 0
% 12.89/7.52 % Propositional check models : 0
% 12.89/7.52 % Propositional check unsatisfiable : 0
% 12.89/7.52 % Propositional clauses : 0
% 12.89/7.52 % Propositional clauses after purity: 0
% 12.89/7.52 % Propositional unsat core size : 0
% 12.89/7.52 % Propositional preprocessing time : 0.000
% 12.89/7.52 % Propositional encoding time : 0.000
% 12.89/7.52 % Propositional solver time : 0.000
% 12.89/7.52 % Success case prop preproc time : 0.000
% 12.89/7.52 % Success case prop encoding time : 0.000
% 12.89/7.52 % Success case prop solver time : 0.000
% 12.89/7.52 % Current number of processed clauses : 121
% 12.89/7.52 % Positive orientable unit clauses : 121
% 12.89/7.52 % Positive unorientable unit clauses: 0
% 12.89/7.52 % Negative unit clauses : 0
% 12.89/7.52 % Non-unit-clauses : 0
% 12.89/7.52 % Current number of unprocessed clauses: 23901
% 12.89/7.52 % ...number of literals in the above : 23901
% 12.89/7.52 % Current number of archived formulas : 0
% 12.89/7.52 % Current number of archived clauses : 49
% 12.89/7.52 % Clause-clause subsumption calls (NU) : 0
% 12.89/7.52 % Rec. Clause-clause subsumption calls : 0
% 12.89/7.52 % Non-unit clause-clause subsumptions : 0
% 12.89/7.52 % Unit Clause-clause subsumption calls : 0
% 12.89/7.52 % Rewrite failures with RHS unbound : 0
% 12.89/7.52 % BW rewrite match attempts : 1331
% 12.89/7.52 % BW rewrite match successes : 41
% 12.89/7.52 % Condensation attempts : 0
% 12.89/7.52 % Condensation successes : 0
% 12.89/7.52 % Termbank termtop insertions : 1707719
% 12.89/7.52 % Search garbage collected termcells : 2
% 12.89/7.52
% 12.89/7.52 % -------------------------------------------------
% 12.89/7.52 % User time : 1.735 s
% 12.89/7.52 % System time : 0.087 s
% 12.89/7.52 % Total time : 1.822 s
% 12.89/7.52 % Maximum resident set size: 3376 pages
% 12.89/7.52
% 12.89/7.52 % -------------------------------------------------
% 12.89/7.52 % User time : 8.658 s
% 12.89/7.52 % System time : 0.402 s
% 12.89/7.52 % Total time : 9.060 s
% 12.89/7.52 % Maximum resident set size: 4608 pages
% 12.89/7.52 % E exiting
%------------------------------------------------------------------------------