%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP579-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:17 PM UTC 2026
% Result : Unsatisfiable 1.34s 0.61s
% Output : CNFRefutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 9 RR)
% Number of literals : 29 ( 28 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 : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_0,plain,
double_divide(double_divide(X1,identity),double_divide(identity,identity)) = double_divide(double_divide(identity,X1),identity) ).
cnf(c_0_1,plain,
double_divide(identity,identity) = identity ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_3,plain,
double_divide(double_divide(X1,double_divide(identity,double_divide(X2,identity))),double_divide(identity,identity)) = double_divide(double_divide(X2,X1),identity) ).
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,plain,
double_divide(X1,identity) = double_divide(identity,X1) ).
cnf(c_0_6,plain,
double_divide(identity,double_divide(X1,double_divide(identity,X2))) = double_divide(X2,double_divide(identity,X1)) ).
cnf(c_0_7,plain,
double_divide(double_divide(X1,X2),double_divide(X3,double_divide(X1,X4))) = double_divide(double_divide(X2,X3),X4) ).
cnf(c_0_8,plain,
double_divide(double_divide(X1,identity),identity) = double_divide(double_divide(identity,X1),identity),
inference(rw,[status(thm)],[c_0_0,c_0_1]) ).
cnf(c_0_9,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_10,plain,
double_divide(double_divide(identity,double_divide(identity,X1)),identity) = double_divide(double_divide(identity,double_divide(X1,identity)),identity),
inference(rw,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
double_divide(double_divide(X1,double_divide(identity,double_divide(identity,X2))),identity) = double_divide(double_divide(X1,X2),identity),
inference(rw,[status(thm)],[c_0_3]) ).
cnf(c_0_12,plain,
double_divide(double_divide(X1,double_divide(identity,double_divide(X2,identity))),identity) = double_divide(double_divide(X2,X1),identity),
inference(rw,[status(thm)],[c_0_3,c_0_1]) ).
cnf(c_0_13,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_9 ).
cnf(c_0_14,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_15,plain,
double_divide(double_divide(double_divide(X1,identity),X2),double_divide(X1,identity)) = double_divide(double_divide(identity,X2),identity),
inference(rw,[status(thm)],[c_0_1]) ).
cnf(c_0_16,plain,
double_divide(double_divide(identity,X1),identity) = double_divide(identity,double_divide(X1,identity)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10]),c_0_11]) ).
cnf(c_0_17,plain,
double_divide(double_divide(X1,identity),identity) = double_divide(identity,double_divide(X1,identity)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10]),c_0_12]) ).
cnf(c_0_18,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_13,c_0_14]),c_0_14]),c_0_14]),c_0_14]) ).
cnf(c_0_19,plain,
double_divide(identity,double_divide(X1,identity)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11]),c_0_15]),c_0_16]),c_0_12]),c_0_17]) ).
cnf(c_0_20,plain,
double_divide(identity,double_divide(identity,double_divide(identity,double_divide(X1,identity)))) = double_divide(identity,double_divide(X1,identity)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8]),c_0_12]),c_0_17]),c_0_16]),c_0_17]) ).
cnf(c_0_21,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_18,c_0_5]),c_0_5]),c_0_5]),c_0_5]) ).
cnf(c_0_22,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_19]),c_0_5]) ).
cnf(c_0_23,plain,
double_divide(identity,double_divide(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19]),c_0_19]) ).
cnf(c_0_24,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_21,c_0_22]) ).
cnf(c_0_25,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(rw,[status(thm)],[c_0_23]) ).
cnf(c_0_26,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)],[c_0_24,c_0_6]),c_0_25]),c_0_6]),c_0_25]) ).
cnf(c_0_27,plain,
double_divide(double_divide(X1,X2),double_divide(X3,X4)) = double_divide(double_divide(X1,X3),double_divide(X2,X4)),
inference(rw,[status(thm)],[c_0_7]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP579-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n020.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 20:18:17 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 1.34/0.61 % Version: 3.5.1
% 1.34/0.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.34/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.34/0.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.34/0.61 % Starting new_bool_3 with 300s (1) cores
% 1.34/0.61 % Starting new_bool_1 with 300s (1) cores
% 1.34/0.61 % Starting sh5l with 300s (1) cores
% 1.34/0.61 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1140713 completed with status 0
% 1.34/0.61 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.34/0.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.34/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.34/0.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.34/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.34/0.61 % No SInE strategy applied
% 1.34/0.61 % Search class: FUUPS-FFSF22-MFFFFFNN
% 1.34/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.34/0.61 % Starting SubtermCWHack with 136s (1) cores
% 1.34/0.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.34/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 1.34/0.61 % Starting new_bool_3 with 136s (1) cores
% 1.34/0.61 % Starting new_bool_1 with 136s (1) cores
% 1.34/0.61 % G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with pid 1140719 completed with status 0
% 1.34/0.61 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 1.34/0.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.34/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.34/0.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.34/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.34/0.61 % No SInE strategy applied
% 1.34/0.61 % Search class: FUUPS-FFSF22-MFFFFFNN
% 1.34/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.34/0.61 % Starting SubtermCWHack with 136s (1) cores
% 1.34/0.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.34/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 1.34/0.61 % Preprocessing time : 0.001 s
% 1.34/0.61 % Presaturation interreduction done
% 1.34/0.61
% 1.34/0.61 % Proof found!
% 1.34/0.61 % SZS status Unsatisfiable
% 1.34/0.61 % SZS output start CNFRefutation
% See solution above
% 1.34/0.61 % Parsed axioms : 5
% 1.34/0.61 % Removed by relevancy pruning/SinE : 0
% 1.34/0.61 % Initial clauses : 5
% 1.34/0.61 % Removed in clause preprocessing : 2
% 1.34/0.61 % Initial clauses in saturation : 3
% 1.34/0.61 % Processed clauses : 2882
% 1.34/0.61 % ...of these trivial : 1499
% 1.34/0.61 % ...subsumed : 1262
% 1.34/0.61 % ...remaining for further processing : 121
% 1.34/0.61 % Other redundant clauses eliminated : 0
% 1.34/0.61 % Clauses deleted for lack of memory : 0
% 1.34/0.61 % Backward-subsumed : 10
% 1.34/0.61 % Backward-rewritten : 71
% 1.34/0.61 % Generated clauses : 13315
% 1.34/0.61 % ...of the previous two non-redundant : 11057
% 1.34/0.61 % ...aggressively subsumed : 0
% 1.34/0.61 % Contextual simplify-reflections : 0
% 1.34/0.61 % Paramodulations : 13315
% 1.34/0.61 % Factorizations : 0
% 1.34/0.61 % NegExts : 0
% 1.34/0.61 % Equation resolutions : 0
% 1.34/0.61 % Disequality decompositions : 0
% 1.34/0.61 % Total rewrite steps : 38561
% 1.34/0.61 % ...of those cached : 28329
% 1.34/0.61 % Propositional unsat checks : 0
% 1.34/0.61 % Propositional check models : 0
% 1.34/0.61 % Propositional check unsatisfiable : 0
% 1.34/0.61 % Propositional clauses : 0
% 1.34/0.61 % Propositional clauses after purity: 0
% 1.34/0.61 % Propositional unsat core size : 0
% 1.34/0.61 % Propositional preprocessing time : 0.000
% 1.34/0.61 % Propositional encoding time : 0.000
% 1.34/0.61 % Propositional solver time : 0.000
% 1.34/0.61 % Success case prop preproc time : 0.000
% 1.34/0.61 % Success case prop encoding time : 0.000
% 1.34/0.61 % Success case prop solver time : 0.000
% 1.34/0.61 % Current number of processed clauses : 37
% 1.34/0.61 % Positive orientable unit clauses : 18
% 1.34/0.61 % Positive unorientable unit clauses: 19
% 1.34/0.61 % Negative unit clauses : 0
% 1.34/0.61 % Non-unit-clauses : 0
% 1.34/0.61 % Current number of unprocessed clauses: 8181
% 1.34/0.61 % ...number of literals in the above : 8181
% 1.34/0.61 % Current number of archived formulas : 0
% 1.34/0.61 % Current number of archived clauses : 86
% 1.34/0.61 % Clause-clause subsumption calls (NU) : 0
% 1.34/0.61 % Rec. Clause-clause subsumption calls : 0
% 1.34/0.61 % Non-unit clause-clause subsumptions : 0
% 1.34/0.61 % Unit Clause-clause subsumption calls : 277
% 1.34/0.61 % Rewrite failures with RHS unbound : 0
% 1.34/0.61 % BW rewrite match attempts : 9362
% 1.34/0.61 % BW rewrite match successes : 528
% 1.34/0.61 % Condensation attempts : 0
% 1.34/0.61 % Condensation successes : 0
% 1.34/0.61 % Termbank termtop insertions : 197030
% 1.34/0.61 % Search garbage collected termcells : 2
% 1.34/0.61
% 1.34/0.61 % -------------------------------------------------
% 1.34/0.61 % User time : 0.171 s
% 1.34/0.61 % System time : 0.010 s
% 1.34/0.61 % Total time : 0.181 s
% 1.34/0.61 % Maximum resident set size: 3632 pages
% 1.34/0.61
% 1.34/0.61 % -------------------------------------------------
% 1.34/0.61 % User time : 0.812 s
% 1.34/0.61 % System time : 0.051 s
% 1.34/0.61 % Total time : 0.864 s
% 1.34/0.61 % Maximum resident set size: 4608 pages
% 1.34/0.61 % E exiting
%------------------------------------------------------------------------------