%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP417-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 : n018.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:45 PM UTC 2026
% Result : Unsatisfiable 3.97s 1.22s
% Output : CNFRefutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 2
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 4 RR)
% Number of literals : 41 ( 40 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 16 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 105 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1)))))) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_2,axiom,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(X3)))),inverse(multiply(inverse(X1),X1)))))) = X3,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,X3))),inverse(multiply(inverse(X1),X1)))))) = multiply(X4,inverse(multiply(inverse(multiply(inverse(multiply(X5,X4)),multiply(X5,inverse(X3)))),inverse(multiply(inverse(X4),X4))))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,inverse(inverse(X3))))),inverse(multiply(inverse(X1),X1))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),X3)),inverse(multiply(inverse(X1),X1)))))) = multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,inverse(inverse(X3))))),inverse(multiply(inverse(X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),inverse(multiply(inverse(X2),X2)))))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_5]),c_0_2]) ).
cnf(c_0_7,plain,
inverse(inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X1)),multiply(X2,X3))),inverse(multiply(inverse(X1),X1))))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(multiply(X2,inverse(X3))))))),inverse(multiply(inverse(X2),X2))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_5]) ).
cnf(c_0_9,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X4)))),inverse(multiply(inverse(inverse(multiply(X2,X3))),inverse(multiply(X2,X3)))))) = multiply(X2,inverse(inverse(multiply(X3,inverse(multiply(X4,inverse(multiply(inverse(X3),X3)))))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_3]),c_0_7]) ).
cnf(c_0_10,plain,
inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,inverse(inverse(multiply(X3,inverse(X4))))))),X1)),X4)),inverse(multiply(inverse(X1),X1)))))) = multiply(inverse(X3),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_8]),c_0_4]) ).
cnf(c_0_11,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))),inverse(multiply(inverse(X2),X2))) = multiply(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,X3))),inverse(multiply(inverse(X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_3]),c_0_2]) ).
cnf(c_0_12,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(inverse(X3),inverse(multiply(inverse(X2),X2))))))))) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_13,plain,
inverse(multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(inverse(multiply(inverse(X1),X1))),inverse(multiply(inverse(X1),X1)))))))) = multiply(inverse(X1),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_8]) ).
cnf(c_0_14,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),X2)))),multiply(X1,inverse(multiply(inverse(X2),X2)))) = multiply(inverse(X3),X3),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X2),X2)))),inverse(multiply(inverse(multiply(X3,multiply(X2,inverse(X4)))),inverse(multiply(inverse(inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X2),X2))))),inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(X3)))),inverse(multiply(inverse(X2),X2)))))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_16,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_17,plain,
inverse(multiply(inverse(X1),inverse(multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(inverse(X1)),inverse(X1))))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_18,plain,
inverse(multiply(inverse(X1),inverse(multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(inverse(X3),X3)))))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_19,plain,
inverse(multiply(inverse(X1),multiply(inverse(X2),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_18]),c_0_18]) ).
cnf(c_0_20,plain,
inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(inverse(X2),X2)))))))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_9]) ).
cnf(c_0_21,plain,
inverse(multiply(inverse(X1),X1)) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_22,plain,
inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))) = inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_11]),c_0_7]) ).
cnf(c_0_23,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(multiply(X2,X3)))))),inverse(multiply(inverse(X2),X2)))) = X3,
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_24,plain,
inverse(multiply(inverse(X1),inverse(multiply(inverse(X2),X2)))) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_25,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(X4,X2)),multiply(X4,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_22]),c_0_2]) ).
cnf(c_0_26,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(inverse(multiply(X2,X3))))) = X3,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(inverse(X3),X2)),multiply(inverse(X4),X4)),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_28,plain,
multiply(inverse(inverse(inverse(multiply(X1,X2)))),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_29,plain,
multiply(inverse(inverse(X1)),multiply(inverse(X2),X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26]) ).
cnf(c_0_30,plain,
inverse(multiply(multiply(inverse(X1),X1),X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_30]),c_0_24]),c_0_19]) ).
cnf(c_0_32,plain,
inverse(inverse(multiply(inverse(X1),X1))) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_33,plain,
inverse(inverse(multiply(X1,multiply(inverse(X1),X2)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_31]),c_0_31]),c_0_24]) ).
cnf(c_0_34,plain,
multiply(inverse(multiply(inverse(X1),X1)),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_31]) ).
cnf(c_0_35,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_32]),c_0_31]),c_0_34]) ).
cnf(c_0_36,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_37,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_36 ).
cnf(c_0_39,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_26]),c_0_35]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP417-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.11/0.37 % Computer : n018.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 20:14:27 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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
% 3.97/1.22 % Version: 3.5.1
% 3.97/1.22 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.97/1.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.97/1.22 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.97/1.22 % Starting new_bool_3 with 300s (1) cores
% 3.97/1.22 % Starting new_bool_1 with 300s (1) cores
% 3.97/1.22 % Starting sh5l with 300s (1) cores
% 3.97/1.22 % new_bool_1 with pid 90608 completed with status 9
% 3.97/1.22 % new_bool_3 with pid 90607 completed with status 9
% 3.97/1.22 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 90606 completed with status 0
% 3.97/1.22 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.97/1.22 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.97/1.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.97/1.22 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.97/1.22 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.97/1.22 % No SInE strategy applied
% 3.97/1.22 % Search class: FUUPF-FFSF21-DFFFFFNN
% 3.97/1.22 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.97/1.22 % Starting SubtermCWHack with 136s (1) cores
% 3.97/1.22 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.97/1.22 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.97/1.22 % Starting new_bool_3 with 136s (1) cores
% 3.97/1.22 % Starting new_bool_1 with 136s (1) cores
% 3.97/1.22 % new_bool_3 with pid 90615 completed with status 0
% 3.97/1.22 % Result found by new_bool_3
% 3.97/1.22 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.97/1.22 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.97/1.22 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.97/1.22 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.97/1.22 % No SInE strategy applied
% 3.97/1.22 % Search class: FUUPF-FFSF21-DFFFFFNN
% 3.97/1.22 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.97/1.22 % Starting SubtermCWHack with 136s (1) cores
% 3.97/1.22 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.97/1.22 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.97/1.22 % Starting new_bool_3 with 136s (1) cores
% 3.97/1.22 % Preprocessing time : 0.002 s
% 3.97/1.22 % Presaturation interreduction done
% 3.97/1.22
% 3.97/1.22 % Proof found!
% 3.97/1.22 % SZS status Unsatisfiable
% 3.97/1.22 % SZS output start CNFRefutation
% See solution above
% 3.97/1.22 % Parsed axioms : 2
% 3.97/1.22 % Removed by relevancy pruning/SinE : 0
% 3.97/1.22 % Initial clauses : 2
% 3.97/1.22 % Removed in clause preprocessing : 0
% 3.97/1.22 % Initial clauses in saturation : 2
% 3.97/1.22 % Processed clauses : 339
% 3.97/1.22 % ...of these trivial : 29
% 3.97/1.22 % ...subsumed : 231
% 3.97/1.22 % ...remaining for further processing : 79
% 3.97/1.22 % Other redundant clauses eliminated : 0
% 3.97/1.22 % Clauses deleted for lack of memory : 0
% 3.97/1.22 % Backward-subsumed : 3
% 3.97/1.22 % Backward-rewritten : 48
% 3.97/1.22 % Generated clauses : 23396
% 3.97/1.22 % ...of the previous two non-redundant : 22521
% 3.97/1.22 % ...aggressively subsumed : 0
% 3.97/1.22 % Contextual simplify-reflections : 0
% 3.97/1.22 % Paramodulations : 23396
% 3.97/1.22 % Factorizations : 0
% 3.97/1.22 % NegExts : 0
% 3.97/1.22 % Equation resolutions : 0
% 3.97/1.22 % Disequality decompositions : 0
% 3.97/1.22 % Total rewrite steps : 14737
% 3.97/1.22 % ...of those cached : 11500
% 3.97/1.22 % Propositional unsat checks : 0
% 3.97/1.22 % Propositional check models : 0
% 3.97/1.22 % Propositional check unsatisfiable : 0
% 3.97/1.22 % Propositional clauses : 0
% 3.97/1.22 % Propositional clauses after purity: 0
% 3.97/1.22 % Propositional unsat core size : 0
% 3.97/1.22 % Propositional preprocessing time : 0.000
% 3.97/1.22 % Propositional encoding time : 0.000
% 3.97/1.22 % Propositional solver time : 0.000
% 3.97/1.22 % Success case prop preproc time : 0.000
% 3.97/1.22 % Success case prop encoding time : 0.000
% 3.97/1.22 % Success case prop solver time : 0.000
% 3.97/1.22 % Current number of processed clauses : 26
% 3.97/1.22 % Positive orientable unit clauses : 18
% 3.97/1.22 % Positive unorientable unit clauses: 8
% 3.97/1.22 % Negative unit clauses : 0
% 3.97/1.22 % Non-unit-clauses : 0
% 3.97/1.22 % Current number of unprocessed clauses: 22150
% 3.97/1.22 % ...number of literals in the above : 22150
% 3.97/1.22 % Current number of archived formulas : 0
% 3.97/1.22 % Current number of archived clauses : 53
% 3.97/1.22 % Clause-clause subsumption calls (NU) : 0
% 3.97/1.22 % Rec. Clause-clause subsumption calls : 0
% 3.97/1.22 % Non-unit clause-clause subsumptions : 0
% 3.97/1.22 % Unit Clause-clause subsumption calls : 381
% 3.97/1.22 % Rewrite failures with RHS unbound : 2050
% 3.97/1.22 % BW rewrite match attempts : 1067
% 3.97/1.22 % BW rewrite match successes : 209
% 3.97/1.22 % Condensation attempts : 0
% 3.97/1.22 % Condensation successes : 0
% 3.97/1.22 % Termbank termtop insertions : 1840541
% 3.97/1.22 % Search garbage collected termcells : 2
% 3.97/1.22
% 3.97/1.22 % -------------------------------------------------
% 3.97/1.22 % User time : 0.713 s
% 3.97/1.22 % System time : 0.032 s
% 3.97/1.22 % Total time : 0.745 s
% 3.97/1.22 % Maximum resident set size: 3380 pages
% 3.97/1.22
% 3.97/1.22 % -------------------------------------------------
% 3.97/1.22 % User time : 3.644 s
% 3.97/1.22 % System time : 0.187 s
% 3.97/1.22 % Total time : 3.831 s
% 3.97/1.22 % Maximum resident set size: 4608 pages
% 3.97/1.22 % E exiting
%------------------------------------------------------------------------------