%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP485-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 : n009.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:39:55 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 7 RR)
% Number of literals : 27 ( 26 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(X1,double_divide(double_divide(double_divide(X1,X2),X3),double_divide(X2,identity))),double_divide(identity,identity)) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(double_divide(X1,double_divide(double_divide(double_divide(X1,X2),X3),double_divide(X2,identity))),double_divide(identity,identity)) = X3,
single_axiom ).
cnf(c_0_4,plain,
double_divide(double_divide(double_divide(double_divide(X1,identity),X2),X3),double_divide(X2,identity)) = double_divide(double_divide(X1,X3),double_divide(identity,identity)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
double_divide(double_divide(double_divide(X1,identity),double_divide(double_divide(X1,X2),double_divide(identity,identity))),double_divide(identity,identity)) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
double_divide(X1,double_divide(double_divide(double_divide(X2,X1),double_divide(identity,identity)),identity)) = double_divide(double_divide(X2,double_divide(identity,identity)),double_divide(identity,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_3]),c_0_4]) ).
cnf(c_0_7,plain,
double_divide(double_divide(double_divide(X1,double_divide(double_divide(double_divide(X1,X2),X3),double_divide(X2,identity))),double_divide(double_divide(X3,X4),double_divide(double_divide(identity,identity),identity))),double_divide(identity,identity)) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
double_divide(double_divide(double_divide(X1,identity),X2),double_divide(identity,identity)) = double_divide(double_divide(double_divide(X1,X3),X2),double_divide(X3,identity)),
inference(spm,[status(thm)],[c_0_5,c_0_3]) ).
cnf(c_0_9,plain,
double_divide(double_divide(identity,identity),double_divide(double_divide(X1,double_divide(identity,identity)),identity)) = double_divide(X1,double_divide(identity,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
cnf(c_0_10,plain,
double_divide(double_divide(double_divide(X1,X2),double_divide(double_divide(X1,X3),double_divide(identity,identity))),double_divide(X2,identity)) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_8]),c_0_4]) ).
cnf(c_0_11,plain,
double_divide(double_divide(identity,identity),double_divide(X1,identity)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
double_divide(double_divide(X1,double_divide(X2,double_divide(double_divide(double_divide(double_divide(X1,X3),X2),double_divide(X3,identity)),identity))),double_divide(identity,identity)) = double_divide(identity,identity),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_13,plain,
double_divide(double_divide(double_divide(identity,X1),identity),double_divide(X1,identity)) = identity,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
double_divide(identity,double_divide(identity,identity)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_11]),c_0_3]) ).
cnf(c_0_15,plain,
double_divide(identity,identity) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_11]) ).
cnf(c_0_16,plain,
double_divide(identity,double_divide(X1,identity)) = X1,
inference(rw,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_17,plain,
double_divide(double_divide(identity,X1),identity) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_15]),c_0_15]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
multiply(identity,a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_19,plain,
double_divide(X1,double_divide(X1,identity)) = identity,
inference(rw,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
multiply(identity,a2) != a2,
c_0_18 ).
cnf(c_0_21,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_22,plain,
double_divide(double_divide(double_divide(X1,identity),double_divide(double_divide(X1,X2),identity)),identity) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_15]) ).
cnf(c_0_23,plain,
double_divide(double_divide(identity,X1),X1) = identity,
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
double_divide(double_divide(a2,identity),identity) != a2,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
double_divide(double_divide(X1,identity),identity) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP485-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.35 % Computer : n009.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Sun Sep 20 20:14:44 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.14/0.41 % Version: 3.5.1
% 0.14/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % new_bool_3 with pid 4147161 completed with status 0
% 0.14/0.41 % Result found by new_bool_3
% 0.14/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.14/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.41 % SubtermCWHack with pid 4147166 completed with status 0
% 0.14/0.41 % Result found by SubtermCWHack
% 0.14/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.14/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.41 % Preprocessing time : 0.001 s
% 0.14/0.41
% 0.14/0.41 % Proof found!
% 0.14/0.41 % SZS status Unsatisfiable
% 0.14/0.41 % SZS output start CNFRefutation
% See solution above
% 0.14/0.41 % Parsed axioms : 5
% 0.14/0.41 % Removed by relevancy pruning/SinE : 2
% 0.14/0.41 % Initial clauses : 3
% 0.14/0.41 % Removed in clause preprocessing : 0
% 0.14/0.41 % Initial clauses in saturation : 3
% 0.14/0.41 % Processed clauses : 39
% 0.14/0.41 % ...of these trivial : 5
% 0.14/0.41 % ...subsumed : 7
% 0.14/0.41 % ...remaining for further processing : 27
% 0.14/0.41 % Other redundant clauses eliminated : 0
% 0.14/0.41 % Clauses deleted for lack of memory : 0
% 0.14/0.41 % Backward-subsumed : 1
% 0.14/0.41 % Backward-rewritten : 14
% 0.14/0.41 % Generated clauses : 551
% 0.14/0.41 % ...of the previous two non-redundant : 395
% 0.14/0.41 % ...aggressively subsumed : 0
% 0.14/0.41 % Contextual simplify-reflections : 0
% 0.14/0.41 % Paramodulations : 551
% 0.14/0.41 % Factorizations : 0
% 0.14/0.41 % NegExts : 0
% 0.14/0.41 % Equation resolutions : 0
% 0.14/0.41 % Disequality decompositions : 0
% 0.14/0.41 % Total rewrite steps : 455
% 0.14/0.41 % ...of those cached : 344
% 0.14/0.41 % Propositional unsat checks : 0
% 0.14/0.41 % Propositional check models : 0
% 0.14/0.41 % Propositional check unsatisfiable : 0
% 0.14/0.41 % Propositional clauses : 0
% 0.14/0.41 % Propositional clauses after purity: 0
% 0.14/0.41 % Propositional unsat core size : 0
% 0.14/0.41 % Propositional preprocessing time : 0.000
% 0.14/0.41 % Propositional encoding time : 0.000
% 0.14/0.41 % Propositional solver time : 0.000
% 0.14/0.41 % Success case prop preproc time : 0.000
% 0.14/0.41 % Success case prop encoding time : 0.000
% 0.14/0.41 % Success case prop solver time : 0.000
% 0.14/0.41 % Current number of processed clauses : 12
% 0.14/0.41 % Positive orientable unit clauses : 11
% 0.14/0.41 % Positive unorientable unit clauses: 1
% 0.14/0.41 % Negative unit clauses : 0
% 0.14/0.41 % Non-unit-clauses : 0
% 0.14/0.41 % Current number of unprocessed clauses: 316
% 0.14/0.41 % ...number of literals in the above : 316
% 0.14/0.41 % Current number of archived formulas : 0
% 0.14/0.41 % Current number of archived clauses : 15
% 0.14/0.41 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.41 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.41 % Non-unit clause-clause subsumptions : 0
% 0.14/0.41 % Unit Clause-clause subsumption calls : 4
% 0.14/0.41 % Rewrite failures with RHS unbound : 43
% 0.14/0.41 % BW rewrite match attempts : 36
% 0.14/0.41 % BW rewrite match successes : 19
% 0.14/0.41 % Condensation attempts : 0
% 0.14/0.42 % Condensation successes : 0
% 0.14/0.42 % Termbank termtop insertions : 9951
% 0.14/0.42 % Search garbage collected termcells : 7
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.006 s
% 0.14/0.42 % System time : 0.001 s
% 0.14/0.42 % Total time : 0.007 s
% 0.14/0.42 % Maximum resident set size: 3580 pages
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.008 s
% 0.14/0.42 % System time : 0.005 s
% 0.14/0.42 % Total time : 0.013 s
% 0.14/0.42 % Maximum resident set size: 4608 pages
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------