%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP094-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:46 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.41s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of clauses : 32 ( 24 unt; 0 nHn; 10 RR)
% Number of literals : 49 ( 48 equ; 26 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,divide(X1,X2)),divide(divide(X2,X3),X1)) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(a4,b4) != multiply(b4,a4)
| 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(inverse,axiom,
inverse(X1) = divide(identity,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_5,axiom,
divide(divide(identity,divide(X1,X2)),divide(divide(X2,X3),X1)) = X3,
single_axiom ).
cnf(c_0_6,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_7,plain,
divide(identity,divide(divide(X1,X2),X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_8,plain,
divide(identity,divide(identity,X1)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
divide(divide(X1,X2),X1) = divide(identity,X2),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( multiply(a4,b4) != multiply(b4,a4)
| 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_11,plain,
divide(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_8]),c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( multiply(a4,b4) != multiply(b4,a4)
| 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_10 ).
cnf(c_0_13,axiom,
inverse(X1) = divide(identity,X1),
inverse ).
cnf(c_0_14,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_15,plain,
divide(X1,divide(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_11]),c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3))))
| divide(divide(identity,b1),divide(identity,b1)) != divide(divide(identity,a1),divide(identity,a1))
| divide(divide(divide(identity,b2),divide(identity,b2)),divide(identity,a2)) != a2
| divide(b4,divide(identity,a4)) != divide(a4,divide(identity,b4)) ),
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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_13]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]) ).
cnf(c_0_17,plain,
divide(identity,divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( divide(identity,divide(identity,a2)) != a2
| divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4))
| divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_6]),c_0_6]),c_0_6])]) ).
cnf(c_0_19,plain,
divide(divide(X1,X2),divide(divide(X1,X3),X2)) = X3,
inference(rw,[status(thm)],[c_0_5,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4))
| divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_8])]) ).
cnf(c_0_21,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(X1,X3),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_22,plain,
divide(divide(X1,X2),divide(identity,X2)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4))
| divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3)) ),
inference(rw,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_24,plain,
divide(divide(X1,X2),divide(identity,X3)) = divide(X1,divide(X2,X3)),
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_25,plain,
divide(X1,divide(X2,divide(X3,X1))) = divide(X3,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4))
| divide(a3,divide(divide(identity,c3),b3)) != divide(a3,divide(divide(identity,b3),c3)) ),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
divide(divide(X1,X2),X3) = divide(divide(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_25]),c_0_17]) ).
cnf(c_0_28,plain,
divide(divide(X1,X2),divide(X1,X3)) = divide(X3,X2),
inference(spm,[status(thm)],[c_0_25,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_30,plain,
divide(X1,divide(X2,X3)) = divide(X3,divide(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_17]),c_0_24]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP094-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n001.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 20:02:28 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/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
% 0.13/0.41 % Version: 3.5.1
% 0.13/0.41 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.13/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.41 % Starting sh5l with 300s (1) cores
% 0.13/0.41 % G----_0031_C18_F1_SE_CS_SP_S0Y with pid 1269135 completed with status 0
% 0.13/0.41 % Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.13/0.41 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.13/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.41 % No SInE strategy applied
% 0.13/0.41 % Search class: FUHPS-FFSF22-MFFFFFNN
% 0.13/0.41 % partial match(1): FUUPS-FFSF22-MFFFFFNN
% 0.13/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.41 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 0.13/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.41 % new_bool_3 with pid 1269145 completed with status 0
% 0.13/0.41 % Result found by new_bool_3
% 0.13/0.41 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.13/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.41 % No SInE strategy applied
% 0.13/0.41 % Search class: FUHPS-FFSF22-MFFFFFNN
% 0.13/0.41 % partial match(1): FUUPS-FFSF22-MFFFFFNN
% 0.13/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.41 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 0.13/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.41 % Preprocessing time : 0.001 s
% 0.13/0.41 % Presaturation interreduction done
% 0.13/0.41
% 0.13/0.41 % Proof found!
% 0.13/0.41 % SZS status Unsatisfiable
% 0.13/0.41 % SZS output start CNFRefutation
% See solution above
% 0.13/0.41 % Parsed axioms : 5
% 0.13/0.41 % Removed by relevancy pruning/SinE : 0
% 0.13/0.41 % Initial clauses : 5
% 0.13/0.41 % Removed in clause preprocessing : 2
% 0.13/0.41 % Initial clauses in saturation : 3
% 0.13/0.41 % Processed clauses : 38
% 0.13/0.41 % ...of these trivial : 7
% 0.13/0.41 % ...subsumed : 1
% 0.13/0.41 % ...remaining for further processing : 30
% 0.13/0.41 % Other redundant clauses eliminated : 0
% 0.13/0.41 % Clauses deleted for lack of memory : 0
% 0.13/0.41 % Backward-subsumed : 0
% 0.13/0.41 % Backward-rewritten : 15
% 0.13/0.41 % Generated clauses : 544
% 0.13/0.41 % ...of the previous two non-redundant : 273
% 0.13/0.41 % ...aggressively subsumed : 0
% 0.13/0.41 % Contextual simplify-reflections : 0
% 0.13/0.41 % Paramodulations : 544
% 0.13/0.41 % Factorizations : 0
% 0.13/0.41 % NegExts : 0
% 0.13/0.41 % Equation resolutions : 0
% 0.13/0.41 % Disequality decompositions : 0
% 0.13/0.41 % Total rewrite steps : 440
% 0.13/0.41 % ...of those cached : 288
% 0.13/0.41 % Propositional unsat checks : 0
% 0.13/0.41 % Propositional check models : 0
% 0.13/0.41 % Propositional check unsatisfiable : 0
% 0.13/0.41 % Propositional clauses : 0
% 0.13/0.41 % Propositional clauses after purity: 0
% 0.13/0.41 % Propositional unsat core size : 0
% 0.13/0.41 % Propositional preprocessing time : 0.000
% 0.13/0.41 % Propositional encoding time : 0.000
% 0.13/0.41 % Propositional solver time : 0.000
% 0.13/0.41 % Success case prop preproc time : 0.000
% 0.13/0.41 % Success case prop encoding time : 0.000
% 0.13/0.41 % Success case prop solver time : 0.000
% 0.13/0.41 % Current number of processed clauses : 12
% 0.13/0.41 % Positive orientable unit clauses : 10
% 0.13/0.41 % Positive unorientable unit clauses: 2
% 0.13/0.41 % Negative unit clauses : 0
% 0.13/0.41 % Non-unit-clauses : 0
% 0.13/0.41 % Current number of unprocessed clauses: 178
% 0.13/0.41 % ...number of literals in the above : 178
% 0.13/0.41 % Current number of archived formulas : 0
% 0.13/0.41 % Current number of archived clauses : 20
% 0.13/0.41 % Clause-clause subsumption calls (NU) : 0
% 0.13/0.41 % Rec. Clause-clause subsumption calls : 0
% 0.13/0.41 % Non-unit clause-clause subsumptions : 0
% 0.13/0.41 % Unit Clause-clause subsumption calls : 12
% 0.13/0.41 % Rewrite failures with RHS unbound : 0
% 0.13/0.41 % BW rewrite match attempts : 88
% 0.13/0.41 % BW rewrite match successes : 58
% 0.13/0.41 % Condensation attempts : 0
% 0.13/0.41 % Condensation successes : 0
% 0.13/0.41 % Termbank termtop insertions : 3951
% 0.13/0.41 % Search garbage collected termcells : 11
% 0.13/0.41
% 0.13/0.41 % -------------------------------------------------
% 0.13/0.41 % User time : 0.006 s
% 0.13/0.41 % System time : 0.004 s
% 0.13/0.41 % Total time : 0.011 s
% 0.13/0.41 % Maximum resident set size: 3636 pages
% 0.13/0.41
% 0.13/0.41 % -------------------------------------------------
% 0.13/0.41 % User time : 0.034 s
% 0.13/0.41 % System time : 0.016 s
% 0.13/0.41 % Total time : 0.050 s
% 0.13/0.41 % Maximum resident set size: 4608 pages
% 0.13/0.41 % E exiting
%------------------------------------------------------------------------------