%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP595-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:20 PM UTC 2026
% Result : Unsatisfiable 0.83s 0.54s
% Output : CNFRefutation 0.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 5 RR)
% Number of literals : 34 ( 33 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 79 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(double_divide(double_divide(X1,X2),inverse(double_divide(X1,inverse(double_divide(X3,X2)))))) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_3,axiom,
inverse(double_divide(double_divide(X1,X2),inverse(double_divide(X1,inverse(double_divide(X3,X2)))))) = X3,
single_axiom ).
cnf(c_0_4,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_5,plain,
multiply(multiply(multiply(X1,X2),X3),double_divide(X3,X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
multiply(X1,double_divide(double_divide(X2,X3),multiply(X3,X1))) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_7,plain,
multiply(multiply(X1,X2),double_divide(X2,multiply(multiply(X3,X1),X4))) = double_divide(X4,X3),
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_8,plain,
double_divide(multiply(X1,double_divide(X2,multiply(X3,X1))),X3) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
double_divide(double_divide(multiply(X1,X2),X3),multiply(X3,X1)) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
multiply(multiply(X1,X2),double_divide(multiply(X2,X3),X1)) = inverse(X3),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_11,plain,
multiply(inverse(X1),double_divide(double_divide(multiply(X2,X1),X3),X3)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_12,plain,
double_divide(multiply(X1,X2),multiply(X3,inverse(X2))) = double_divide(X1,X3),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_13,plain,
double_divide(multiply(inverse(X1),double_divide(X2,X3)),X3) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_14,plain,
multiply(double_divide(multiply(X1,X2),X3),X2) = double_divide(X1,X3),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_15,plain,
multiply(X1,double_divide(X1,multiply(X2,X3))) = double_divide(X3,X2),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_16,plain,
inverse(multiply(X1,X2)) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_17,plain,
multiply(X1,double_divide(X1,inverse(X2))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_9]) ).
cnf(c_0_18,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_9]) ).
cnf(c_0_19,plain,
multiply(X1,double_divide(X1,X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
double_divide(double_divide(X1,X2),X2) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_21,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_18]) ).
cnf(c_0_22,plain,
multiply(X1,multiply(X2,double_divide(X3,multiply(X1,X2)))) = inverse(X3),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_23,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_24,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
multiply(X1,multiply(multiply(X2,double_divide(X3,multiply(X1,X2))),double_divide(X4,inverse(X3)))) = inverse(X4),
inference(spm,[status(thm)],[c_0_22,c_0_22]) ).
cnf(c_0_26,plain,
multiply(multiply(X1,X2),multiply(double_divide(multiply(X2,X3),X1),double_divide(X4,inverse(X3)))) = inverse(X4),
inference(spm,[status(thm)],[c_0_22,c_0_10]) ).
cnf(c_0_27,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_23 ).
cnf(c_0_28,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_24]),c_0_4]) ).
cnf(c_0_29,plain,
double_divide(X1,double_divide(X2,multiply(X3,X1))) = multiply(X3,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_18]),c_0_16]),c_0_24]) ).
cnf(c_0_30,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_18]),c_0_4]) ).
cnf(c_0_31,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_29]),c_0_4]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP595-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n020.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sun Sep 20 20:18:47 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.83/0.54 % Version: 3.5.1
% 0.83/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.83/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.83/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.83/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.83/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.83/0.54 % Starting sh5l with 300s (1) cores
% 0.83/0.54 % new_bool_3 with pid 1142328 completed with status 0
% 0.83/0.54 % Result found by new_bool_3
% 0.83/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.83/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.83/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.83/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.83/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.83/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.83/0.54 % Search class: FUUPS-FFSF21-DFFFFFNN
% 0.83/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.83/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.83/0.54 % SubtermCWHack with pid 1142331 completed with status 0
% 0.83/0.54 % Result found by SubtermCWHack
% 0.83/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.83/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.83/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.83/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.83/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.83/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.83/0.54 % Search class: FUUPS-FFSF21-DFFFFFNN
% 0.83/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.83/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.83/0.54 % Preprocessing time : 0.001 s
% 0.83/0.54
% 0.83/0.54 % Proof found!
% 0.83/0.54 % SZS status Unsatisfiable
% 0.83/0.54 % SZS output start CNFRefutation
% See solution above
% 0.83/0.54 % Parsed axioms : 3
% 0.83/0.54 % Removed by relevancy pruning/SinE : 0
% 0.83/0.54 % Initial clauses : 3
% 0.83/0.54 % Removed in clause preprocessing : 0
% 0.83/0.54 % Initial clauses in saturation : 3
% 0.83/0.54 % Processed clauses : 466
% 0.83/0.54 % ...of these trivial : 174
% 0.83/0.54 % ...subsumed : 168
% 0.83/0.54 % ...remaining for further processing : 124
% 0.83/0.54 % Other redundant clauses eliminated : 0
% 0.83/0.54 % Clauses deleted for lack of memory : 0
% 0.83/0.54 % Backward-subsumed : 0
% 0.83/0.54 % Backward-rewritten : 76
% 0.83/0.54 % Generated clauses : 10786
% 0.83/0.54 % ...of the previous two non-redundant : 9701
% 0.83/0.54 % ...aggressively subsumed : 0
% 0.83/0.54 % Contextual simplify-reflections : 0
% 0.83/0.54 % Paramodulations : 10786
% 0.83/0.54 % Factorizations : 0
% 0.83/0.54 % NegExts : 0
% 0.83/0.54 % Equation resolutions : 0
% 0.83/0.54 % Disequality decompositions : 0
% 0.83/0.54 % Total rewrite steps : 7603
% 0.83/0.54 % ...of those cached : 5463
% 0.83/0.54 % Propositional unsat checks : 0
% 0.83/0.54 % Propositional check models : 0
% 0.83/0.54 % Propositional check unsatisfiable : 0
% 0.83/0.54 % Propositional clauses : 0
% 0.83/0.54 % Propositional clauses after purity: 0
% 0.83/0.54 % Propositional unsat core size : 0
% 0.83/0.54 % Propositional preprocessing time : 0.000
% 0.83/0.54 % Propositional encoding time : 0.000
% 0.83/0.54 % Propositional solver time : 0.000
% 0.83/0.54 % Success case prop preproc time : 0.000
% 0.83/0.54 % Success case prop encoding time : 0.000
% 0.83/0.54 % Success case prop solver time : 0.000
% 0.83/0.54 % Current number of processed clauses : 48
% 0.83/0.54 % Positive orientable unit clauses : 44
% 0.83/0.54 % Positive unorientable unit clauses: 4
% 0.83/0.54 % Negative unit clauses : 0
% 0.83/0.54 % Non-unit-clauses : 0
% 0.83/0.54 % Current number of unprocessed clauses: 8564
% 0.83/0.54 % ...number of literals in the above : 8564
% 0.83/0.54 % Current number of archived formulas : 0
% 0.83/0.54 % Current number of archived clauses : 76
% 0.83/0.54 % Clause-clause subsumption calls (NU) : 0
% 0.83/0.54 % Rec. Clause-clause subsumption calls : 0
% 0.83/0.54 % Non-unit clause-clause subsumptions : 0
% 0.83/0.54 % Unit Clause-clause subsumption calls : 92
% 0.83/0.54 % Rewrite failures with RHS unbound : 98
% 0.83/0.54 % BW rewrite match attempts : 425
% 0.83/0.54 % BW rewrite match successes : 232
% 0.83/0.54 % Condensation attempts : 0
% 0.83/0.54 % Condensation successes : 0
% 0.83/0.54 % Termbank termtop insertions : 104724
% 0.83/0.54 % Search garbage collected termcells : 2
% 0.83/0.54
% 0.83/0.54 % -------------------------------------------------
% 0.83/0.54 % User time : 0.112 s
% 0.83/0.54 % System time : 0.011 s
% 0.83/0.54 % Total time : 0.123 s
% 0.83/0.54 % Maximum resident set size: 3632 pages
% 0.83/0.54
% 0.83/0.54 % -------------------------------------------------
% 0.83/0.54 % User time : 0.117 s
% 0.83/0.54 % System time : 0.012 s
% 0.83/0.54 % Total time : 0.129 s
% 0.83/0.54 % Maximum resident set size: 4864 pages
% 0.83/0.54 % E exiting
%------------------------------------------------------------------------------