%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP074-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:41:43 PM UTC 2026
% Result : Unsatisfiable 0.59s 0.49s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of clauses : 38 ( 34 unt; 0 nHn; 6 RR)
% Number of literals : 46 ( 45 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 112 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(divide(divide(X1,X1),X2),divide(X3,divide(X2,X4)))),X4) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(inverse(divide(divide(divide(X1,X1),X2),divide(X3,divide(X2,X4)))),X4) = X3,
single_axiom ).
cnf(c_0_4,plain,
divide(inverse(divide(divide(divide(X1,X1),X2),X3)),X4) = inverse(divide(divide(divide(X5,X5),X6),divide(X3,divide(X6,divide(X2,X4))))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(divide(divide(divide(X1,X1),X2),divide(divide(X3,divide(X4,X5)),divide(X2,divide(X4,X5))))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
divide(divide(inverse(divide(divide(divide(X1,X1),X2),X3)),X4),divide(X2,X4)) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,plain,
inverse(divide(divide(divide(X1,X1),X2),divide(divide(X3,X4),divide(X2,X4)))) = X3,
inference(spm,[status(thm)],[c_0_5,c_0_3]) ).
cnf(c_0_8,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X4),divide(X3,X4)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
divide(divide(inverse(divide(divide(divide(X1,X1),X2),divide(X3,X2))),X4),divide(X5,X4)) = divide(X3,X5),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,plain,
divide(divide(inverse(divide(X1,X2)),X3),divide(divide(X4,inverse(divide(divide(divide(X5,X5),X4),X1))),X3)) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_11,plain,
divide(divide(inverse(divide(divide(divide(X1,X2),divide(X3,X2)),X4)),X5),divide(divide(X3,X1),X5)) = X4,
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_12,plain,
divide(X1,divide(X2,inverse(divide(divide(divide(X3,X3),X2),divide(divide(X4,X4),X5))))) = divide(X1,X5),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
divide(inverse(divide(divide(divide(X1,X1),inverse(divide(divide(divide(X2,X2),X3),divide(X4,divide(X3,X5))))),divide(X6,X4))),X5) = X6,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_14,plain,
divide(X1,inverse(divide(divide(divide(X2,X2),X1),divide(divide(X3,X3),X4)))) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_11]) ).
cnf(c_0_15,plain,
divide(inverse(divide(divide(divide(X1,X1),X2),divide(X3,divide(X4,X4)))),X2) = X3,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
divide(X1,divide(X2,X2)) = divide(X1,divide(X3,X3)),
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_17,plain,
divide(X1,X1) = divide(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_16]),c_0_11]) ).
cnf(c_0_18,plain,
divide(X1,inverse(divide(X2,X2))) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_19,plain,
divide(divide(inverse(divide(divide(divide(X1,X1),X2),X3)),X4),X5) = inverse(divide(divide(divide(X6,X6),X7),divide(divide(X3,divide(X8,divide(X2,X4))),divide(X7,divide(X8,X5))))),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_20,plain,
inverse(divide(X1,X1)) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
inverse(divide(divide(X1,X1),X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_6]),c_0_18]) ).
cnf(c_0_22,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_23,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_14]),c_0_22]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_25,plain,
divide(inverse(divide(X1,divide(X2,divide(divide(X3,inverse(divide(divide(divide(X4,X4),X3),X1))),X5)))),X5) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_26,plain,
divide(inverse(divide(X1,X1)),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_23,c_0_23]) ).
cnf(c_0_27,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
c_0_24 ).
cnf(c_0_29,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_30,plain,
divide(divide(X1,inverse(X2)),X2) = X1,
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_25,c_0_26]),c_0_23]),c_0_18]),c_0_27]),c_0_23]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| divide(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1))
| divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_29]),c_0_29]),c_0_29]),c_0_29]),c_0_29]),c_0_29]),c_0_29]) ).
cnf(c_0_32,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_15]),c_0_23]),c_0_27]),c_0_22]) ).
cnf(c_0_33,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(X1,X3),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_34,plain,
divide(divide(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_26]),c_0_18]),c_0_23]),c_0_27]) ).
cnf(c_0_35,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[c_0_31,c_0_17]),c_0_32]),c_0_23]),c_0_27])]) ).
cnf(c_0_36,plain,
divide(divide(X1,inverse(X2)),X3) = divide(X1,divide(X3,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP074-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n008.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 19:57:40 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 0.59/0.49 % Version: 3.5.1
% 0.59/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.59/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.59/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.59/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.59/0.49 % Starting sh5l with 300s (1) cores
% 0.59/0.49 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3477661 completed with status 0
% 0.59/0.49 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.59/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.59/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.59/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.59/0.49 % No SInE strategy applied
% 0.59/0.49 % Search class: FUHPF-FFSF21-MFFFFFNN
% 0.59/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.59/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.59/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.59/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.59/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.59/0.49 % Starting new_bool_1 with 136s (1) cores
% 0.59/0.49 % SubtermCWHack with pid 3477665 completed with status 0
% 0.59/0.49 % Result found by SubtermCWHack
% 0.59/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.59/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.59/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.59/0.49 % No SInE strategy applied
% 0.59/0.49 % Search class: FUHPF-FFSF21-MFFFFFNN
% 0.59/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.59/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.59/0.49 % Preprocessing time : 0.001 s
% 0.59/0.49
% 0.59/0.49 % Proof found!
% 0.59/0.49 % SZS status Unsatisfiable
% 0.59/0.49 % SZS output start CNFRefutation
% See solution above
% 0.59/0.49 % Parsed axioms : 3
% 0.59/0.49 % Removed by relevancy pruning/SinE : 0
% 0.59/0.49 % Initial clauses : 3
% 0.59/0.49 % Removed in clause preprocessing : 1
% 0.59/0.49 % Initial clauses in saturation : 2
% 0.59/0.49 % Processed clauses : 177
% 0.59/0.49 % ...of these trivial : 53
% 0.59/0.49 % ...subsumed : 71
% 0.59/0.49 % ...remaining for further processing : 53
% 0.59/0.49 % Other redundant clauses eliminated : 0
% 0.59/0.49 % Clauses deleted for lack of memory : 0
% 0.59/0.49 % Backward-subsumed : 2
% 0.59/0.49 % Backward-rewritten : 35
% 0.59/0.49 % Generated clauses : 5099
% 0.59/0.49 % ...of the previous two non-redundant : 4588
% 0.59/0.49 % ...aggressively subsumed : 0
% 0.59/0.49 % Contextual simplify-reflections : 0
% 0.59/0.49 % Paramodulations : 5098
% 0.59/0.49 % Factorizations : 0
% 0.59/0.49 % NegExts : 0
% 0.59/0.49 % Equation resolutions : 0
% 0.59/0.49 % Disequality decompositions : 0
% 0.59/0.49 % Total rewrite steps : 4148
% 0.59/0.49 % ...of those cached : 2902
% 0.59/0.49 % Propositional unsat checks : 0
% 0.59/0.49 % Propositional check models : 0
% 0.59/0.49 % Propositional check unsatisfiable : 0
% 0.59/0.49 % Propositional clauses : 0
% 0.59/0.49 % Propositional clauses after purity: 0
% 0.59/0.49 % Propositional unsat core size : 0
% 0.59/0.49 % Propositional preprocessing time : 0.000
% 0.59/0.49 % Propositional encoding time : 0.000
% 0.59/0.49 % Propositional solver time : 0.000
% 0.59/0.49 % Success case prop preproc time : 0.000
% 0.59/0.49 % Success case prop encoding time : 0.000
% 0.59/0.49 % Success case prop solver time : 0.000
% 0.59/0.49 % Current number of processed clauses : 15
% 0.59/0.49 % Positive orientable unit clauses : 14
% 0.59/0.49 % Positive unorientable unit clauses: 1
% 0.59/0.49 % Negative unit clauses : 0
% 0.59/0.49 % Non-unit-clauses : 0
% 0.59/0.49 % Current number of unprocessed clauses: 438
% 0.59/0.49 % ...number of literals in the above : 438
% 0.59/0.49 % Current number of archived formulas : 0
% 0.59/0.49 % Current number of archived clauses : 39
% 0.59/0.49 % Clause-clause subsumption calls (NU) : 0
% 0.59/0.49 % Rec. Clause-clause subsumption calls : 0
% 0.59/0.49 % Non-unit clause-clause subsumptions : 0
% 0.59/0.49 % Unit Clause-clause subsumption calls : 58
% 0.59/0.49 % Rewrite failures with RHS unbound : 345
% 0.59/0.49 % BW rewrite match attempts : 411
% 0.59/0.49 % BW rewrite match successes : 81
% 0.59/0.49 % Condensation attempts : 0
% 0.59/0.49 % Condensation successes : 0
% 0.59/0.49 % Termbank termtop insertions : 95491
% 0.59/0.49 % Search garbage collected termcells : 8
% 0.59/0.49
% 0.59/0.49 % -------------------------------------------------
% 0.59/0.49 % User time : 0.046 s
% 0.59/0.49 % System time : 0.007 s
% 0.59/0.49 % Total time : 0.053 s
% 0.59/0.49 % Maximum resident set size: 3636 pages
% 0.59/0.49
% 0.59/0.49 % -------------------------------------------------
% 0.59/0.49 % User time : 0.211 s
% 0.59/0.49 % System time : 0.029 s
% 0.59/0.49 % Total time : 0.240 s
% 0.59/0.49 % Maximum resident set size: 4608 pages
% 0.59/0.49 % E exiting
%------------------------------------------------------------------------------