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