%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP543-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 : n008.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:13 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.65s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 7 RR)
% Number of literals : 31 ( 30 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,divide(divide(divide(X1,X2),X3),X1)),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(divide(divide(X1,X2),X3),X1)),X3) = X2,
single_axiom ).
cnf(c_0_5,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_6,plain,
divide(divide(identity,divide(divide(identity,X1),X2)),X1) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
divide(divide(identity,divide(identity,X1)),divide(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
divide(divide(identity,divide(identity,X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_9,plain,
divide(identity,divide(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_5]) ).
cnf(c_0_10,plain,
divide(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
divide(X1,divide(X1,X2)) = X2,
inference(rw,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_12,plain,
divide(identity,divide(divide(X1,X2),X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_10]),c_0_10]) ).
cnf(c_0_13,plain,
divide(divide(X1,X2),X1) = divide(identity,X2),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
divide(identity,divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
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(X1,divide(divide(X1,X2),X3)),X3) = X2,
inference(rw,[status(thm)],[c_0_4,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_15 ).
cnf(c_0_18,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_19,plain,
divide(divide(X1,X2),divide(identity,X2)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_20,plain,
divide(divide(X1,divide(divide(X1,X2),X3)),X2) = X3,
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
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_17,c_0_18]),c_0_18]),c_0_18]),c_0_18]) ).
cnf(c_0_22,plain,
divide(divide(X1,divide(identity,X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_23,plain,
divide(divide(X1,X2),divide(divide(X1,X3),X2)) = X3,
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_24,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_25,plain,
divide(divide(identity,X1),X2) = divide(divide(identity,X2),X1),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_26,plain,
divide(X1,divide(X2,X3)) = divide(X3,divide(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_23]),c_0_14]) ).
cnf(c_0_27,plain,
divide(divide(X1,X2),X3) = divide(divide(X1,X3),X2),
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_28,negated_conjecture,
divide(b3,divide(divide(identity,a3),c3)) != divide(a3,divide(divide(identity,b3),c3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_14]),c_0_27]),c_0_26]) ).
cnf(c_0_29,plain,
divide(X1,divide(divide(X2,X3),X4)) = divide(X4,divide(divide(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP543-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.57 % Computer : n008.cluster.edu
% 0.10/0.57 % Model : x86_64 x86_64
% 0.10/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57 % Memory : 8046.5625MB
% 0.10/0.57 % OS : Linux 6.8.0-71-generic
% 0.10/0.57 % CPULimit : 300
% 0.10/0.57 % WCLimit : 300
% 0.10/0.57 % DateTime : Sun Sep 20 20:17:09 UTC 2026
% 0.10/0.57 % CPUTime :
% 0.10/0.57 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.62 Running first-order theorem proving
% 0.10/0.62 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.15/0.65 % Version: 3.5.1
% 0.15/0.65 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.65 % Starting sh5l with 300s (1) cores
% 0.15/0.65 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3520868 completed with status 0
% 0.15/0.65 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.65 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.65 % No SInE strategy applied
% 0.15/0.65 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.15/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 0.15/0.65 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.65 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.65 % SubtermCWHack with pid 3520872 completed with status 0
% 0.15/0.65 % Result found by SubtermCWHack
% 0.15/0.65 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.65 % No SInE strategy applied
% 0.15/0.65 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.15/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.65 % Preprocessing time : 0.001 s
% 0.15/0.65
% 0.15/0.65 % Proof found!
% 0.15/0.65 % SZS status Unsatisfiable
% 0.15/0.65 % SZS output start CNFRefutation
% See solution above
% 0.15/0.65 % Parsed axioms : 5
% 0.15/0.65 % Removed by relevancy pruning/SinE : 0
% 0.15/0.65 % Initial clauses : 5
% 0.15/0.65 % Removed in clause preprocessing : 2
% 0.15/0.65 % Initial clauses in saturation : 3
% 0.15/0.65 % Processed clauses : 251
% 0.15/0.65 % ...of these trivial : 76
% 0.15/0.65 % ...subsumed : 126
% 0.15/0.65 % ...remaining for further processing : 49
% 0.15/0.65 % Other redundant clauses eliminated : 0
% 0.15/0.65 % Clauses deleted for lack of memory : 0
% 0.15/0.65 % Backward-subsumed : 2
% 0.15/0.65 % Backward-rewritten : 30
% 0.15/0.65 % Generated clauses : 2621
% 0.15/0.65 % ...of the previous two non-redundant : 1587
% 0.15/0.65 % ...aggressively subsumed : 0
% 0.15/0.65 % Contextual simplify-reflections : 0
% 0.15/0.65 % Paramodulations : 2621
% 0.15/0.65 % Factorizations : 0
% 0.15/0.65 % NegExts : 0
% 0.15/0.65 % Equation resolutions : 0
% 0.15/0.65 % Disequality decompositions : 0
% 0.15/0.65 % Total rewrite steps : 3323
% 0.15/0.65 % ...of those cached : 2241
% 0.15/0.65 % Propositional unsat checks : 0
% 0.15/0.65 % Propositional check models : 0
% 0.15/0.65 % Propositional check unsatisfiable : 0
% 0.15/0.65 % Propositional clauses : 0
% 0.15/0.65 % Propositional clauses after purity: 0
% 0.15/0.65 % Propositional unsat core size : 0
% 0.15/0.65 % Propositional preprocessing time : 0.000
% 0.15/0.65 % Propositional encoding time : 0.000
% 0.15/0.65 % Propositional solver time : 0.000
% 0.15/0.65 % Success case prop preproc time : 0.000
% 0.15/0.65 % Success case prop encoding time : 0.000
% 0.15/0.65 % Success case prop solver time : 0.000
% 0.15/0.65 % Current number of processed clauses : 17
% 0.15/0.65 % Positive orientable unit clauses : 12
% 0.15/0.65 % Positive unorientable unit clauses: 5
% 0.15/0.65 % Negative unit clauses : 0
% 0.15/0.65 % Non-unit-clauses : 0
% 0.15/0.65 % Current number of unprocessed clauses: 1022
% 0.15/0.65 % ...number of literals in the above : 1022
% 0.15/0.65 % Current number of archived formulas : 0
% 0.15/0.65 % Current number of archived clauses : 34
% 0.15/0.65 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.65 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.65 % Non-unit clause-clause subsumptions : 0
% 0.15/0.65 % Unit Clause-clause subsumption calls : 32
% 0.15/0.65 % Rewrite failures with RHS unbound : 0
% 0.15/0.65 % BW rewrite match attempts : 145
% 0.15/0.65 % BW rewrite match successes : 112
% 0.15/0.65 % Condensation attempts : 0
% 0.15/0.65 % Condensation successes : 0
% 0.15/0.65 % Termbank termtop insertions : 24899
% 0.15/0.65 % Search garbage collected termcells : 2
% 0.15/0.65
% 0.15/0.65 % -------------------------------------------------
% 0.15/0.65 % User time : 0.015 s
% 0.15/0.65 % System time : 0.002 s
% 0.15/0.65 % Total time : 0.017 s
% 0.15/0.65 % Maximum resident set size: 3632 pages
% 0.15/0.65
% 0.15/0.65 % -------------------------------------------------
% 0.15/0.65 % User time : 0.056 s
% 0.15/0.65 % System time : 0.012 s
% 0.15/0.65 % Total time : 0.068 s
% 0.15/0.65 % Maximum resident set size: 4608 pages
% 0.15/0.65 % E exiting
%------------------------------------------------------------------------------