%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP575-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 : n019.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:17 PM UTC 2026
% Result : Unsatisfiable 2.42s 0.70s
% Output : CNFRefutation 2.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 8 RR)
% Number of literals : 19 ( 18 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_2,plain,
double_divide(identity,double_divide(identity,double_divide(identity,double_divide(identity,X1)))) = X1 ).
cnf(c_0_3,plain,
double_divide(identity,double_divide(identity,double_divide(identity,X1))) = double_divide(X1,identity) ).
cnf(c_0_4,plain,
double_divide(X1,identity) = double_divide(identity,X1) ).
cnf(c_0_5,plain,
double_divide(identity,double_divide(X1,double_divide(identity,X2))) = double_divide(X2,double_divide(X1,identity)) ).
cnf(c_0_6,plain,
double_divide(double_divide(X1,X2),double_divide(X3,X4)) = double_divide(double_divide(X1,X3),double_divide(X2,X4)) ).
cnf(c_0_7,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_8,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_7 ).
cnf(c_0_9,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_10,negated_conjecture,
double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity) != double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9]),c_0_9]),c_0_9]) ).
cnf(c_0_11,plain,
double_divide(identity,double_divide(X1,identity)) = X1,
inference(rw,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_12,negated_conjecture,
double_divide(identity,double_divide(double_divide(identity,double_divide(c3,b3)),a3)) != double_divide(identity,double_divide(c3,double_divide(identity,double_divide(b3,a3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_4]),c_0_4]),c_0_4]),c_0_4]) ).
cnf(c_0_13,plain,
double_divide(identity,double_divide(X1,X2)) = double_divide(identity,double_divide(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11]),c_0_4]) ).
cnf(c_0_14,plain,
double_divide(identity,double_divide(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4]),c_0_11]) ).
cnf(c_0_15,negated_conjecture,
double_divide(identity,double_divide(a3,double_divide(identity,double_divide(c3,b3)))) != double_divide(identity,double_divide(c3,double_divide(identity,double_divide(b3,a3)))),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(rw,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
double_divide(double_divide(identity,a3),double_divide(c3,b3)) != double_divide(double_divide(identity,c3),double_divide(b3,a3)),
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_15,c_0_5]),c_0_16]),c_0_16]),c_0_5]),c_0_16]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_6]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP575-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.34 % Computer : n019.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8046.5625MB
% 0.10/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Sun Sep 20 20:17:20 UTC 2026
% 0.10/0.34 % CPUTime :
% 0.10/0.34 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/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
% 2.42/0.70 % Version: 3.5.1
% 2.42/0.70 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.42/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.42/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.42/0.70 % Starting new_bool_3 with 300s (1) cores
% 2.42/0.70 % Starting new_bool_1 with 300s (1) cores
% 2.42/0.70 % Starting sh5l with 300s (1) cores
% 2.42/0.70 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 837560 completed with status 0
% 2.42/0.70 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.42/0.70 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.42/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.42/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.42/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.42/0.70 % No SInE strategy applied
% 2.42/0.70 % Search class: FUUPS-FFSF22-MFFFFFNN
% 2.42/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.42/0.70 % Starting SubtermCWHack with 136s (1) cores
% 2.42/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.42/0.70 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 2.42/0.70 % Starting new_bool_3 with 136s (1) cores
% 2.42/0.70 % Starting new_bool_1 with 136s (1) cores
% 2.42/0.70 % G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with pid 837567 completed with status 0
% 2.42/0.70 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 2.42/0.70 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.42/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.42/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.42/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.42/0.70 % No SInE strategy applied
% 2.42/0.70 % Search class: FUUPS-FFSF22-MFFFFFNN
% 2.42/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.42/0.70 % Starting SubtermCWHack with 136s (1) cores
% 2.42/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 2.42/0.70 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 2.42/0.70 % Preprocessing time : 0.001 s
% 2.42/0.70 % Presaturation interreduction done
% 2.42/0.70
% 2.42/0.70 % Proof found!
% 2.42/0.70 % SZS status Unsatisfiable
% 2.42/0.70 % SZS output start CNFRefutation
% See solution above
% 2.42/0.70 % Parsed axioms : 5
% 2.42/0.70 % Removed by relevancy pruning/SinE : 0
% 2.42/0.70 % Initial clauses : 5
% 2.42/0.70 % Removed in clause preprocessing : 2
% 2.42/0.70 % Initial clauses in saturation : 3
% 2.42/0.70 % Processed clauses : 4212
% 2.42/0.70 % ...of these trivial : 2008
% 2.42/0.70 % ...subsumed : 2057
% 2.42/0.70 % ...remaining for further processing : 147
% 2.42/0.70 % Other redundant clauses eliminated : 0
% 2.42/0.70 % Clauses deleted for lack of memory : 0
% 2.42/0.70 % Backward-subsumed : 11
% 2.42/0.70 % Backward-rewritten : 79
% 2.42/0.70 % Generated clauses : 25015
% 2.42/0.70 % ...of the previous two non-redundant : 21408
% 2.42/0.70 % ...aggressively subsumed : 0
% 2.42/0.70 % Contextual simplify-reflections : 0
% 2.42/0.70 % Paramodulations : 25015
% 2.42/0.70 % Factorizations : 0
% 2.42/0.70 % NegExts : 0
% 2.42/0.70 % Equation resolutions : 0
% 2.42/0.70 % Disequality decompositions : 0
% 2.42/0.70 % Total rewrite steps : 47910
% 2.42/0.70 % ...of those cached : 37967
% 2.42/0.70 % Propositional unsat checks : 0
% 2.42/0.70 % Propositional check models : 0
% 2.42/0.70 % Propositional check unsatisfiable : 0
% 2.42/0.70 % Propositional clauses : 0
% 2.42/0.70 % Propositional clauses after purity: 0
% 2.42/0.70 % Propositional unsat core size : 0
% 2.42/0.70 % Propositional preprocessing time : 0.000
% 2.42/0.70 % Propositional encoding time : 0.000
% 2.42/0.70 % Propositional solver time : 0.000
% 2.42/0.70 % Success case prop preproc time : 0.000
% 2.42/0.70 % Success case prop encoding time : 0.000
% 2.42/0.70 % Success case prop solver time : 0.000
% 2.42/0.70 % Current number of processed clauses : 54
% 2.42/0.70 % Positive orientable unit clauses : 19
% 2.42/0.70 % Positive unorientable unit clauses: 35
% 2.42/0.70 % Negative unit clauses : 0
% 2.42/0.70 % Non-unit-clauses : 0
% 2.42/0.70 % Current number of unprocessed clauses: 17202
% 2.42/0.70 % ...number of literals in the above : 17202
% 2.42/0.70 % Current number of archived formulas : 0
% 2.42/0.70 % Current number of archived clauses : 95
% 2.42/0.70 % Clause-clause subsumption calls (NU) : 0
% 2.42/0.70 % Rec. Clause-clause subsumption calls : 0
% 2.42/0.70 % Non-unit clause-clause subsumptions : 0
% 2.42/0.70 % Unit Clause-clause subsumption calls : 599
% 2.42/0.70 % Rewrite failures with RHS unbound : 0
% 2.42/0.70 % BW rewrite match attempts : 14143
% 2.42/0.70 % BW rewrite match successes : 862
% 2.42/0.70 % Condensation attempts : 0
% 2.42/0.70 % Condensation successes : 0
% 2.42/0.70 % Termbank termtop insertions : 331526
% 2.42/0.70 % Search garbage collected termcells : 2
% 2.42/0.70
% 2.42/0.70 % -------------------------------------------------
% 2.42/0.70 % User time : 0.267 s
% 2.42/0.70 % System time : 0.018 s
% 2.42/0.70 % Total time : 0.285 s
% 2.42/0.70 % Maximum resident set size: 3632 pages
% 2.42/0.70
% 2.42/0.70 % -------------------------------------------------
% 2.42/0.70 % User time : 1.310 s
% 2.42/0.70 % System time : 0.073 s
% 2.42/0.70 % Total time : 1.383 s
% 2.42/0.70 % Maximum resident set size: 4864 pages
% 2.42/0.70 % E exiting
%------------------------------------------------------------------------------