%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP456-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 : n004.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:51 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.81s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 6 RR)
% Number of literals : 26 ( 25 equ; 5 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_4,axiom,
divide(divide(identity,divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3) = X2,
single_axiom ).
cnf(c_0_5,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_6,plain,
divide(divide(identity,divide(X1,divide(X2,divide(divide(identity,X1),X3)))),X3) = X2,
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
divide(divide(identity,divide(X1,divide(X2,identity))),divide(identity,X1)) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
divide(identity,divide(identity,divide(X1,identity))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_5]) ).
cnf(c_0_9,plain,
divide(divide(identity,divide(identity,divide(X1,divide(identity,X2)))),X2) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_10,plain,
divide(identity,divide(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_5]),c_0_8]) ).
cnf(c_0_11,plain,
divide(divide(identity,divide(identity,divide(X1,identity))),identity) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_12,plain,
divide(divide(X1,divide(identity,X2)),X2) = X1,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
divide(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_14,plain,
divide(identity,divide(X1,X2)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_7]),c_0_13]) ).
cnf(c_0_15,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_16,plain,
divide(divide(divide(X1,divide(divide(identity,X2),X3)),X2),X3) = X1,
inference(rw,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_17,plain,
divide(X1,divide(X2,divide(identity,X1))) = divide(identity,X2),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_15 ).
cnf(c_0_19,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_20,plain,
divide(divide(divide(X1,divide(identity,X2)),X3),divide(X2,X3)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_10]) ).
cnf(c_0_21,negated_conjecture,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_19]),c_0_19]) ).
cnf(c_0_22,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(X1,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_20]),c_0_5]),c_0_13]) ).
cnf(c_0_23,negated_conjecture,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3)),
inference(rw,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_24,plain,
divide(divide(X1,divide(identity,X2)),X3) = divide(X1,divide(X3,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP456-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.10/0.73 % Computer : n004.cluster.edu
% 0.10/0.73 % Model : x86_64 x86_64
% 0.10/0.73 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.73 % Memory : 8046.5625MB
% 0.10/0.73 % OS : Linux 6.8.0-71-generic
% 0.10/0.73 % CPULimit : 300
% 0.10/0.73 % WCLimit : 300
% 0.10/0.73 % DateTime : Sun Sep 20 20:13:54 UTC 2026
% 0.10/0.74 % CPUTime :
% 0.10/0.74 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.78 Running first-order theorem proving
% 0.10/0.78 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.81 % Version: 3.5.1
% 0.14/0.81 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.81 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.81 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.81 % Starting sh5l with 300s (1) cores
% 0.14/0.81 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1392673 completed with status 0
% 0.14/0.81 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.81 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.81 % No SInE strategy applied
% 0.14/0.81 % Search class: FUUPS-FFSF22-DFFFFFNN
% 0.14/0.81 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.81 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.81 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.81 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.81 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.81 % SubtermCWHack with pid 1392679 completed with status 0
% 0.14/0.81 % Result found by SubtermCWHack
% 0.14/0.81 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.81 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.81 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.81 % No SInE strategy applied
% 0.14/0.81 % Search class: FUUPS-FFSF22-DFFFFFNN
% 0.14/0.81 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.81 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.81 % Preprocessing time : 0.001 s
% 0.14/0.81
% 0.14/0.81 % Proof found!
% 0.14/0.81 % SZS status Unsatisfiable
% 0.14/0.81 % SZS output start CNFRefutation
% See solution above
% 0.14/0.81 % Parsed axioms : 5
% 0.14/0.81 % Removed by relevancy pruning/SinE : 0
% 0.14/0.81 % Initial clauses : 5
% 0.14/0.81 % Removed in clause preprocessing : 2
% 0.14/0.81 % Initial clauses in saturation : 3
% 0.14/0.81 % Processed clauses : 35
% 0.14/0.81 % ...of these trivial : 13
% 0.14/0.81 % ...subsumed : 0
% 0.14/0.81 % ...remaining for further processing : 22
% 0.14/0.81 % Other redundant clauses eliminated : 0
% 0.14/0.81 % Clauses deleted for lack of memory : 0
% 0.14/0.81 % Backward-subsumed : 0
% 0.14/0.81 % Backward-rewritten : 13
% 0.14/0.81 % Generated clauses : 355
% 0.14/0.81 % ...of the previous two non-redundant : 132
% 0.14/0.81 % ...aggressively subsumed : 0
% 0.14/0.81 % Contextual simplify-reflections : 0
% 0.14/0.81 % Paramodulations : 355
% 0.14/0.81 % Factorizations : 0
% 0.14/0.81 % NegExts : 0
% 0.14/0.81 % Equation resolutions : 0
% 0.14/0.81 % Disequality decompositions : 0
% 0.14/0.81 % Total rewrite steps : 488
% 0.14/0.81 % ...of those cached : 365
% 0.14/0.81 % Propositional unsat checks : 0
% 0.14/0.81 % Propositional check models : 0
% 0.14/0.81 % Propositional check unsatisfiable : 0
% 0.14/0.81 % Propositional clauses : 0
% 0.14/0.81 % Propositional clauses after purity: 0
% 0.14/0.81 % Propositional unsat core size : 0
% 0.14/0.81 % Propositional preprocessing time : 0.000
% 0.14/0.81 % Propositional encoding time : 0.000
% 0.14/0.81 % Propositional solver time : 0.000
% 0.14/0.81 % Success case prop preproc time : 0.000
% 0.14/0.81 % Success case prop encoding time : 0.000
% 0.14/0.81 % Success case prop solver time : 0.000
% 0.14/0.81 % Current number of processed clauses : 9
% 0.14/0.81 % Positive orientable unit clauses : 9
% 0.14/0.81 % Positive unorientable unit clauses: 0
% 0.14/0.81 % Negative unit clauses : 0
% 0.14/0.81 % Non-unit-clauses : 0
% 0.14/0.81 % Current number of unprocessed clauses: 50
% 0.14/0.81 % ...number of literals in the above : 50
% 0.14/0.81 % Current number of archived formulas : 0
% 0.14/0.81 % Current number of archived clauses : 15
% 0.14/0.81 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.81 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.81 % Non-unit clause-clause subsumptions : 0
% 0.14/0.81 % Unit Clause-clause subsumption calls : 0
% 0.14/0.81 % Rewrite failures with RHS unbound : 0
% 0.14/0.81 % BW rewrite match attempts : 25
% 0.14/0.81 % BW rewrite match successes : 13
% 0.14/0.81 % Condensation attempts : 0
% 0.14/0.81 % Condensation successes : 0
% 0.14/0.81 % Termbank termtop insertions : 3389
% 0.14/0.81 % Search garbage collected termcells : 2
% 0.14/0.81
% 0.14/0.81 % -------------------------------------------------
% 0.14/0.81 % User time : 0.007 s
% 0.14/0.81 % System time : 0.002 s
% 0.14/0.81 % Total time : 0.009 s
% 0.14/0.81 % Maximum resident set size: 3636 pages
% 0.14/0.81
% 0.14/0.81 % -------------------------------------------------
% 0.14/0.81 % User time : 0.027 s
% 0.14/0.81 % System time : 0.014 s
% 0.14/0.81 % Total time : 0.041 s
% 0.14/0.81 % Maximum resident set size: 4864 pages
% 0.14/0.81 % E exiting
%------------------------------------------------------------------------------