%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP604-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 : 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:40:21 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 5 RR)
% Number of literals : 26 ( 25 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(double_divide(inverse(double_divide(X1,inverse(double_divide(X2,double_divide(X1,X3))))),X3)) = 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) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
inverse(double_divide(inverse(double_divide(X1,inverse(double_divide(X2,double_divide(X1,X3))))),X3)) = X2,
single_axiom ).
cnf(c_0_4,plain,
inverse(double_divide(X1,inverse(double_divide(X2,double_divide(X1,double_divide(X3,X4)))))) = inverse(double_divide(inverse(double_divide(X3,X2)),X4)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(double_divide(inverse(double_divide(inverse(double_divide(X1,X2)),X3)),double_divide(X1,X3))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
inverse(double_divide(X1,double_divide(inverse(double_divide(X2,X1)),double_divide(X2,X3)))) = X3,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_7,plain,
inverse(double_divide(inverse(double_divide(X1,X2)),double_divide(X3,X2))) = double_divide(inverse(double_divide(X4,X3)),double_divide(X4,X1)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
inverse(double_divide(inverse(double_divide(X1,X2)),double_divide(inverse(double_divide(inverse(double_divide(X3,X1)),X4)),X2))) = double_divide(X3,X4),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_9,plain,
double_divide(inverse(double_divide(X1,X2)),double_divide(X1,inverse(double_divide(X2,X3)))) = X3,
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
double_divide(X1,inverse(double_divide(X2,double_divide(inverse(double_divide(X1,X2)),X3)))) = X3,
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,plain,
inverse(double_divide(inverse(X1),double_divide(X2,double_divide(X2,inverse(double_divide(X3,X1)))))) = X3,
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_12,plain,
double_divide(inverse(double_divide(X1,inverse(X2))),inverse(double_divide(X3,X2))) = double_divide(X1,X3),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
inverse(double_divide(X1,inverse(double_divide(inverse(double_divide(X2,X3)),double_divide(X1,X3))))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_14,plain,
double_divide(X1,inverse(double_divide(inverse(X2),double_divide(X1,X3)))) = inverse(double_divide(X3,X2)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_15,plain,
inverse(inverse(double_divide(X1,double_divide(X2,X1)))) = X2,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
multiply(a,b) != multiply(b,a),
inference(fof_simplification,[status(thm)],[prove_these_axioms_4]) ).
cnf(c_0_17,plain,
double_divide(inverse(double_divide(inverse(double_divide(X1,inverse(X2))),X3)),double_divide(X1,X3)) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_18,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_19,negated_conjecture,
multiply(a,b) != multiply(b,a),
c_0_16 ).
cnf(c_0_20,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_21,plain,
double_divide(X1,double_divide(inverse(double_divide(X2,X1)),double_divide(X2,inverse(X3)))) = X3,
inference(spm,[status(thm)],[c_0_17,c_0_5]) ).
cnf(c_0_22,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(rw,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
inverse(double_divide(a,b)) != inverse(double_divide(b,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_24,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP604-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.11/0.36 % Computer : n001.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 20:23:27 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.15/0.46 % Version: 3.5.1
% 0.15/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % new_bool_3 with pid 1323738 completed with status 0
% 0.15/0.46 % Result found by new_bool_3
% 0.15/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.46 % Search class: FUUPS-FFSF21-DFFFFFNN
% 0.15/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.46 % SubtermCWHack with pid 1323743 completed with status 0
% 0.15/0.46 % Result found by SubtermCWHack
% 0.15/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.46 % Search class: FUUPS-FFSF21-DFFFFFNN
% 0.15/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.46 % Preprocessing time : 0.002 s
% 0.15/0.46
% 0.15/0.46 % Proof found!
% 0.15/0.46 % SZS status Unsatisfiable
% 0.15/0.46 % SZS output start CNFRefutation
% See solution above
% 0.15/0.46 % Parsed axioms : 3
% 0.15/0.46 % Removed by relevancy pruning/SinE : 0
% 0.15/0.46 % Initial clauses : 3
% 0.15/0.46 % Removed in clause preprocessing : 0
% 0.15/0.46 % Initial clauses in saturation : 3
% 0.15/0.46 % Processed clauses : 24
% 0.15/0.46 % ...of these trivial : 0
% 0.15/0.46 % ...subsumed : 0
% 0.15/0.46 % ...remaining for further processing : 24
% 0.15/0.46 % Other redundant clauses eliminated : 0
% 0.15/0.46 % Clauses deleted for lack of memory : 0
% 0.15/0.46 % Backward-subsumed : 0
% 0.15/0.46 % Backward-rewritten : 7
% 0.15/0.46 % Generated clauses : 796
% 0.15/0.46 % ...of the previous two non-redundant : 652
% 0.15/0.46 % ...aggressively subsumed : 0
% 0.15/0.46 % Contextual simplify-reflections : 0
% 0.15/0.46 % Paramodulations : 796
% 0.15/0.46 % Factorizations : 0
% 0.15/0.46 % NegExts : 0
% 0.15/0.46 % Equation resolutions : 0
% 0.15/0.46 % Disequality decompositions : 0
% 0.15/0.46 % Total rewrite steps : 115
% 0.15/0.46 % ...of those cached : 22
% 0.15/0.46 % Propositional unsat checks : 0
% 0.15/0.46 % Propositional check models : 0
% 0.15/0.46 % Propositional check unsatisfiable : 0
% 0.15/0.46 % Propositional clauses : 0
% 0.15/0.46 % Propositional clauses after purity: 0
% 0.15/0.46 % Propositional unsat core size : 0
% 0.15/0.46 % Propositional preprocessing time : 0.000
% 0.15/0.46 % Propositional encoding time : 0.000
% 0.15/0.46 % Propositional solver time : 0.000
% 0.15/0.46 % Success case prop preproc time : 0.000
% 0.15/0.46 % Success case prop encoding time : 0.000
% 0.15/0.46 % Success case prop solver time : 0.000
% 0.15/0.46 % Current number of processed clauses : 17
% 0.15/0.46 % Positive orientable unit clauses : 15
% 0.15/0.46 % Positive unorientable unit clauses: 2
% 0.15/0.46 % Negative unit clauses : 0
% 0.15/0.46 % Non-unit-clauses : 0
% 0.15/0.46 % Current number of unprocessed clauses: 628
% 0.15/0.46 % ...number of literals in the above : 628
% 0.15/0.46 % Current number of archived formulas : 0
% 0.15/0.46 % Current number of archived clauses : 7
% 0.15/0.46 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.46 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.46 % Non-unit clause-clause subsumptions : 0
% 0.15/0.46 % Unit Clause-clause subsumption calls : 16
% 0.15/0.46 % Rewrite failures with RHS unbound : 11
% 0.15/0.46 % BW rewrite match attempts : 102
% 0.15/0.46 % BW rewrite match successes : 61
% 0.15/0.46 % Condensation attempts : 0
% 0.15/0.46 % Condensation successes : 0
% 0.15/0.46 % Termbank termtop insertions : 9193
% 0.15/0.46 % Search garbage collected termcells : 2
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.021 s
% 0.15/0.46 % System time : 0.003 s
% 0.15/0.46 % Total time : 0.023 s
% 0.15/0.46 % Maximum resident set size: 3580 pages
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.023 s
% 0.15/0.46 % System time : 0.009 s
% 0.15/0.46 % Total time : 0.032 s
% 0.15/0.46 % Maximum resident set size: 4608 pages
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------