%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP474-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 : n013.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:53 PM UTC 2026
% Result : Unsatisfiable 0.99s 0.64s
% Output : CNFRefutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 5 RR)
% Number of literals : 32 ( 31 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
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,inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
single_axiom ).
cnf(c_0_4,plain,
divide(divide(inverse(X1),divide(divide(X2,X3),divide(inverse(divide(X4,X1)),divide(divide(X5,X6),X4)))),divide(X3,X2)) = divide(X6,X5),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(divide(X1,X2),divide(inverse(X3),divide(divide(X2,X1),divide(inverse(divide(X4,X3)),divide(divide(X5,X6),X4))))) = divide(X5,X6),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
divide(divide(inverse(divide(X1,X2)),divide(X3,X1)),divide(divide(X4,X5),divide(inverse(divide(X6,X3)),divide(divide(X5,X4),X6)))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_7,plain,
divide(divide(inverse(divide(X1,X2)),divide(divide(divide(X3,X4),divide(inverse(divide(X5,X6)),divide(divide(X4,X3),X5))),X1)),X6) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
divide(divide(X1,X2),divide(inverse(X3),divide(divide(X2,X1),divide(inverse(divide(X4,X3)),divide(X5,X4))))) = X5,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
divide(divide(inverse(divide(divide(inverse(X1),divide(X2,divide(inverse(divide(X3,X1)),divide(X4,X3)))),X5)),X4),X2) = X5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_3]) ).
cnf(c_0_10,plain,
divide(divide(inverse(divide(X1,X2)),divide(X2,X1)),divide(X3,X4)) = divide(X4,X3),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_11,plain,
divide(divide(X1,X2),divide(inverse(divide(X3,X4)),divide(X4,X3))) = divide(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_10]),c_0_10]) ).
cnf(c_0_12,plain,
divide(divide(X1,X2),divide(inverse(X3),divide(X2,X1))) = X3,
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_13,plain,
divide(X1,divide(inverse(divide(X2,X3)),divide(X3,X2))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
cnf(c_0_14,plain,
divide(divide(inverse(divide(divide(inverse(X1),X2),X3)),X1),X2) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_3]) ).
cnf(c_0_15,plain,
divide(inverse(divide(inverse(X1),X2)),X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_13]) ).
cnf(c_0_16,plain,
divide(inverse(X1),divide(inverse(X2),X1)) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_17,plain,
divide(divide(inverse(divide(divide(X1,X2),X3)),X4),divide(divide(divide(X2,X1),X5),inverse(divide(X5,X4)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_18,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_19,plain,
divide(divide(divide(X1,X2),X3),divide(divide(divide(divide(divide(divide(X4,X5),X6),divide(X7,X6)),divide(divide(X2,divide(X5,X4)),X7)),X8),divide(X3,X8))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_17]),c_0_18]),c_0_18]),c_0_18]),c_0_18]) ).
cnf(c_0_20,plain,
divide(divide(X1,X2),divide(inverse(X3),divide(X2,X3))) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_21,plain,
divide(X1,divide(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_19]),c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_23,plain,
divide(divide(X1,X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
divide(divide(divide(X1,X2),divide(X3,X2)),inverse(X3)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_21]),c_0_18]) ).
cnf(c_0_25,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_22 ).
cnf(c_0_27,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_28,plain,
divide(divide(X1,X2),divide(X3,X2)) = divide(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_27]),c_0_27]),c_0_27]) ).
cnf(c_0_30,plain,
divide(divide(X1,inverse(X2)),X3) = divide(X1,divide(X3,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_18]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP474-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.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:13:37 UTC 2026
% 0.15/0.38 % CPUTime :
% 0.15/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.42 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.99/0.64 % Version: 3.5.1
% 0.99/0.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.99/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.99/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.99/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.99/0.64 % Starting sh5l with 300s (1) cores
% 0.99/0.64 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3317165 completed with status 0
% 0.99/0.64 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.99/0.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.99/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.99/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.99/0.64 % No SInE strategy applied
% 0.99/0.64 % Search class: FUUPF-FFSF21-MFFFFFNN
% 0.99/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.99/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.99/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.99/0.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.99/0.64 % Starting new_bool_3 with 136s (1) cores
% 0.99/0.64 % Starting new_bool_1 with 136s (1) cores
% 0.99/0.64 % SubtermCWHack with pid 3317169 completed with status 0
% 0.99/0.64 % Result found by SubtermCWHack
% 0.99/0.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.99/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.99/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.99/0.64 % No SInE strategy applied
% 0.99/0.64 % Search class: FUUPF-FFSF21-MFFFFFNN
% 0.99/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.99/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.99/0.64 % Preprocessing time : 0.001 s
% 0.99/0.64
% 0.99/0.64 % Proof found!
% 0.99/0.64 % SZS status Unsatisfiable
% 0.99/0.64 % SZS output start CNFRefutation
% See solution above
% 0.99/0.64 % Parsed axioms : 3
% 0.99/0.64 % Removed by relevancy pruning/SinE : 0
% 0.99/0.64 % Initial clauses : 3
% 0.99/0.64 % Removed in clause preprocessing : 1
% 0.99/0.64 % Initial clauses in saturation : 2
% 0.99/0.64 % Processed clauses : 239
% 0.99/0.64 % ...of these trivial : 116
% 0.99/0.64 % ...subsumed : 66
% 0.99/0.64 % ...remaining for further processing : 56
% 0.99/0.64 % Other redundant clauses eliminated : 0
% 0.99/0.64 % Clauses deleted for lack of memory : 0
% 0.99/0.64 % Backward-subsumed : 0
% 0.99/0.64 % Backward-rewritten : 24
% 0.99/0.64 % Generated clauses : 8226
% 0.99/0.64 % ...of the previous two non-redundant : 6905
% 0.99/0.64 % ...aggressively subsumed : 0
% 0.99/0.64 % Contextual simplify-reflections : 0
% 0.99/0.64 % Paramodulations : 8226
% 0.99/0.64 % Factorizations : 0
% 0.99/0.64 % NegExts : 0
% 0.99/0.64 % Equation resolutions : 0
% 0.99/0.64 % Disequality decompositions : 0
% 0.99/0.64 % Total rewrite steps : 11877
% 0.99/0.64 % ...of those cached : 8146
% 0.99/0.64 % Propositional unsat checks : 0
% 0.99/0.64 % Propositional check models : 0
% 0.99/0.64 % Propositional check unsatisfiable : 0
% 0.99/0.64 % Propositional clauses : 0
% 0.99/0.64 % Propositional clauses after purity: 0
% 0.99/0.64 % Propositional unsat core size : 0
% 0.99/0.64 % Propositional preprocessing time : 0.000
% 0.99/0.64 % Propositional encoding time : 0.000
% 0.99/0.64 % Propositional solver time : 0.000
% 0.99/0.64 % Success case prop preproc time : 0.000
% 0.99/0.64 % Success case prop encoding time : 0.000
% 0.99/0.64 % Success case prop solver time : 0.000
% 0.99/0.64 % Current number of processed clauses : 32
% 0.99/0.64 % Positive orientable unit clauses : 31
% 0.99/0.64 % Positive unorientable unit clauses: 1
% 0.99/0.64 % Negative unit clauses : 0
% 0.99/0.64 % Non-unit-clauses : 0
% 0.99/0.64 % Current number of unprocessed clauses: 6541
% 0.99/0.64 % ...number of literals in the above : 6541
% 0.99/0.64 % Current number of archived formulas : 0
% 0.99/0.64 % Current number of archived clauses : 25
% 0.99/0.64 % Clause-clause subsumption calls (NU) : 0
% 0.99/0.64 % Rec. Clause-clause subsumption calls : 0
% 0.99/0.64 % Non-unit clause-clause subsumptions : 0
% 0.99/0.64 % Unit Clause-clause subsumption calls : 18
% 0.99/0.64 % Rewrite failures with RHS unbound : 60
% 0.99/0.64 % BW rewrite match attempts : 346
% 0.99/0.64 % BW rewrite match successes : 28
% 0.99/0.64 % Condensation attempts : 0
% 0.99/0.64 % Condensation successes : 0
% 0.99/0.64 % Termbank termtop insertions : 148406
% 0.99/0.64 % Search garbage collected termcells : 2
% 0.99/0.64
% 0.99/0.64 % -------------------------------------------------
% 0.99/0.64 % User time : 0.188 s
% 0.99/0.64 % System time : 0.018 s
% 0.99/0.64 % Total time : 0.206 s
% 0.99/0.64 % Maximum resident set size: 3580 pages
% 0.99/0.64
% 0.99/0.64 % -------------------------------------------------
% 0.99/0.64 % User time : 0.956 s
% 0.99/0.64 % System time : 0.076 s
% 0.99/0.64 % Total time : 1.032 s
% 0.99/0.64 % Maximum resident set size: 4864 pages
% 0.99/0.64 % E exiting
%------------------------------------------------------------------------------