%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP576-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:44:16 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.57s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 8 RR)
% Number of literals : 34 ( 33 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(single_axiom,axiom,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X3,X1)),double_divide(X3,identity))),double_divide(identity,identity)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_5,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_6,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_7,axiom,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X3,X1)),double_divide(X3,identity))),double_divide(identity,identity)) = X2,
single_axiom ).
cnf(c_0_8,plain,
identity = double_divide(X1,double_divide(X1,identity)),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(double_divide(identity,double_divide(identity,double_divide(X1,identity))),double_divide(identity,identity)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(identity,identity),double_divide(identity,identity)) = identity,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
double_divide(identity,identity) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_10]),c_0_8]),c_0_10]) ).
cnf(c_0_12,plain,
double_divide(double_divide(identity,double_divide(identity,double_divide(X1,identity))),identity) = X1,
inference(rw,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_13,plain,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X3,X1)),double_divide(X3,identity))),identity) = X2,
inference(rw,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,plain,
double_divide(double_divide(identity,double_divide(identity,double_divide(X1,identity))),X1) = identity,
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_15,plain,
double_divide(double_divide(X1,double_divide(double_divide(X2,identity),X1)),identity) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_16,plain,
double_divide(double_divide(identity,double_divide(double_divide(X1,X2),X2)),identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_13]),c_0_13]) ).
cnf(c_0_17,plain,
double_divide(double_divide(X1,double_divide(identity,X1)),identity) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_18,plain,
double_divide(X1,double_divide(identity,X1)) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_8]),c_0_11]) ).
cnf(c_0_19,plain,
double_divide(double_divide(X1,identity),identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_8]) ).
cnf(c_0_20,plain,
double_divide(double_divide(identity,X1),identity) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_21,plain,
double_divide(double_divide(X1,X2),X2) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_22,plain,
double_divide(X1,identity) = double_divide(identity,X1),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
multiply(a,b) != multiply(b,a),
inference(fof_simplification,[status(thm)],[prove_these_axioms_4]) ).
cnf(c_0_24,plain,
double_divide(identity,double_divide(X1,double_divide(double_divide(X2,identity),X1))) = X2,
inference(rw,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
multiply(a,b) != multiply(b,a),
c_0_23 ).
cnf(c_0_26,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_27,plain,
double_divide(X1,double_divide(X2,double_divide(double_divide(X1,identity),X2))) = identity,
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_28,plain,
double_divide(identity,double_divide(X1,identity)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_8]) ).
cnf(c_0_29,negated_conjecture,
double_divide(double_divide(b,a),identity) != double_divide(double_divide(a,b),identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]) ).
cnf(c_0_30,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_27]),c_0_19]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
double_divide(identity,double_divide(a,b)) != double_divide(identity,double_divide(b,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_22]),c_0_22]) ).
cnf(c_0_32,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP576-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.51 % Computer : n008.cluster.edu
% 0.10/0.51 % Model : x86_64 x86_64
% 0.10/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.51 % Memory : 8046.5625MB
% 0.10/0.51 % OS : Linux 6.8.0-71-generic
% 0.10/0.51 % CPULimit : 300
% 0.10/0.51 % WCLimit : 300
% 0.10/0.51 % DateTime : Sun Sep 20 20:17:55 UTC 2026
% 0.10/0.52 % CPUTime :
% 0.10/0.52 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.55 Running first-order theorem proving
% 0.10/0.55 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.10/0.57 % Version: 3.5.1
% 0.10/0.57 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.57 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.57 % Starting sh5l with 300s (1) cores
% 0.10/0.57 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3522887 completed with status 0
% 0.10/0.57 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.10/0.57 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.57 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.57 % No SInE strategy applied
% 0.10/0.57 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.10/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.57 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 0.10/0.57 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.57 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.57 % SubtermCWHack with pid 3522891 completed with status 0
% 0.10/0.57 % Result found by SubtermCWHack
% 0.10/0.57 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.57 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.57 % No SInE strategy applied
% 0.10/0.57 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.10/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.57 % Preprocessing time : 0.001 s
% 0.10/0.57
% 0.10/0.57 % Proof found!
% 0.10/0.57 % SZS status Unsatisfiable
% 0.10/0.57 % SZS output start CNFRefutation
% See solution above
% 0.24/0.57 % Parsed axioms : 5
% 0.24/0.57 % Removed by relevancy pruning/SinE : 0
% 0.24/0.57 % Initial clauses : 5
% 0.24/0.57 % Removed in clause preprocessing : 2
% 0.24/0.57 % Initial clauses in saturation : 3
% 0.24/0.57 % Processed clauses : 43
% 0.24/0.57 % ...of these trivial : 9
% 0.24/0.57 % ...subsumed : 5
% 0.24/0.57 % ...remaining for further processing : 29
% 0.24/0.57 % Other redundant clauses eliminated : 0
% 0.24/0.57 % Clauses deleted for lack of memory : 0
% 0.24/0.57 % Backward-subsumed : 1
% 0.24/0.57 % Backward-rewritten : 24
% 0.24/0.57 % Generated clauses : 285
% 0.24/0.57 % ...of the previous two non-redundant : 165
% 0.24/0.57 % ...aggressively subsumed : 0
% 0.24/0.57 % Contextual simplify-reflections : 0
% 0.24/0.57 % Paramodulations : 285
% 0.24/0.57 % Factorizations : 0
% 0.24/0.57 % NegExts : 0
% 0.24/0.57 % Equation resolutions : 0
% 0.24/0.57 % Disequality decompositions : 0
% 0.24/0.57 % Total rewrite steps : 308
% 0.24/0.57 % ...of those cached : 234
% 0.24/0.57 % Propositional unsat checks : 0
% 0.24/0.57 % Propositional check models : 0
% 0.24/0.57 % Propositional check unsatisfiable : 0
% 0.24/0.57 % Propositional clauses : 0
% 0.24/0.57 % Propositional clauses after purity: 0
% 0.24/0.57 % Propositional unsat core size : 0
% 0.24/0.57 % Propositional preprocessing time : 0.000
% 0.24/0.57 % Propositional encoding time : 0.000
% 0.24/0.57 % Propositional solver time : 0.000
% 0.24/0.57 % Success case prop preproc time : 0.000
% 0.24/0.57 % Success case prop encoding time : 0.000
% 0.24/0.57 % Success case prop solver time : 0.000
% 0.24/0.57 % Current number of processed clauses : 4
% 0.24/0.57 % Positive orientable unit clauses : 3
% 0.24/0.57 % Positive unorientable unit clauses: 1
% 0.24/0.57 % Negative unit clauses : 0
% 0.24/0.57 % Non-unit-clauses : 0
% 0.24/0.57 % Current number of unprocessed clauses: 76
% 0.24/0.57 % ...number of literals in the above : 76
% 0.24/0.57 % Current number of archived formulas : 0
% 0.24/0.57 % Current number of archived clauses : 27
% 0.24/0.57 % Clause-clause subsumption calls (NU) : 0
% 0.24/0.57 % Rec. Clause-clause subsumption calls : 0
% 0.24/0.57 % Non-unit clause-clause subsumptions : 0
% 0.24/0.57 % Unit Clause-clause subsumption calls : 7
% 0.24/0.57 % Rewrite failures with RHS unbound : 0
% 0.24/0.57 % BW rewrite match attempts : 85
% 0.24/0.57 % BW rewrite match successes : 51
% 0.24/0.57 % Condensation attempts : 0
% 0.24/0.57 % Condensation successes : 0
% 0.24/0.57 % Termbank termtop insertions : 3089
% 0.24/0.57 % Search garbage collected termcells : 2
% 0.24/0.57
% 0.24/0.57 % -------------------------------------------------
% 0.24/0.57 % User time : 0.005 s
% 0.24/0.57 % System time : 0.003 s
% 0.24/0.57 % Total time : 0.009 s
% 0.24/0.57 % Maximum resident set size: 3376 pages
% 0.24/0.57
% 0.24/0.57 % -------------------------------------------------
% 0.24/0.57 % User time : 0.025 s
% 0.24/0.57 % System time : 0.011 s
% 0.24/0.57 % Total time : 0.036 s
% 0.24/0.57 % Maximum resident set size: 4608 pages
% 0.24/0.57 % E exiting
%------------------------------------------------------------------------------