%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP470-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:43:52 PM UTC 2026
% Result : Unsatisfiable 0.54s 0.54s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 3
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 6 RR)
% Number of literals : 46 ( 45 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 144 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(X1,divide(X2,divide(X3,X4)))),divide(divide(X4,X3),X1)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(inverse(divide(X1,divide(X2,divide(X3,X4)))),divide(divide(X4,X3),X1)) = X2,
single_axiom ).
cnf(c_0_4,plain,
divide(inverse(divide(X1,X2)),divide(divide(X3,divide(X4,X5)),X1)) = inverse(divide(X3,divide(X2,divide(X5,X4)))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(divide(X1,divide(divide(X2,divide(divide(X3,X4),X1)),divide(X4,X3)))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
inverse(inverse(divide(X1,divide(X2,divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3)))))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
divide(inverse(X1),divide(divide(X2,X3),inverse(divide(divide(X3,X2),divide(X1,divide(X4,X5)))))) = divide(X5,X4),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
inverse(divide(divide(inverse(divide(divide(X1,X2),divide(X3,X4))),divide(X2,X1)),divide(X5,divide(X4,X3)))) = inverse(inverse(X5)),
inference(spm,[status(thm)],[c_0_6,c_0_3]) ).
cnf(c_0_9,plain,
divide(divide(divide(X1,X2),inverse(divide(divide(X2,X1),divide(X3,divide(X4,X5))))),inverse(X3)) = divide(X4,X5),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_7]),c_0_7]) ).
cnf(c_0_10,plain,
divide(inverse(inverse(X1)),divide(divide(X2,X3),divide(inverse(divide(divide(X4,X5),divide(X2,X3))),divide(X5,X4)))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_11,plain,
divide(divide(divide(X1,X2),inverse(divide(divide(X2,X1),divide(X3,X4)))),inverse(X3)) = X4,
inference(spm,[status(thm)],[c_0_9,c_0_3]) ).
cnf(c_0_12,plain,
divide(inverse(divide(X1,divide(X2,X3))),divide(divide(divide(divide(X4,X5),X6),inverse(divide(X6,divide(X3,divide(X5,X4))))),X1)) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_13,plain,
divide(inverse(inverse(X1)),divide(X2,divide(inverse(divide(divide(X3,X4),X2)),divide(X4,X3)))) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_14,plain,
divide(divide(divide(X1,X2),X3),inverse(divide(X3,divide(divide(X4,X5),divide(X2,X1))))) = divide(X5,X4),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_15,plain,
divide(inverse(X1),divide(divide(divide(X2,X3),inverse(divide(divide(X3,X2),X4))),inverse(inverse(X1)))) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,plain,
divide(X1,divide(divide(divide(X2,X3),inverse(divide(divide(X3,X2),X4))),inverse(X1))) = X4,
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_17,plain,
divide(divide(inverse(divide(divide(X1,X2),X3)),divide(divide(X4,X5),divide(X1,X2))),divide(X5,X4)) = X3,
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_18,plain,
divide(divide(inverse(divide(X1,X2)),divide(divide(X3,X4),X1)),divide(X4,X3)) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_19,plain,
divide(divide(divide(divide(divide(X1,X2),X3),inverse(divide(X3,X4))),inverse(X4)),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_20,plain,
divide(divide(X1,inverse(X2)),inverse(inverse(divide(X3,X4)))) = divide(divide(X1,divide(inverse(X4),X2)),X3),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_21,plain,
inverse(divide(divide(X1,X2),divide(X3,divide(divide(divide(X2,X1),X4),inverse(X3))))) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_20]),c_0_4]) ).
cnf(c_0_22,plain,
divide(X1,divide(divide(inverse(X2),divide(divide(X3,X4),X1)),divide(X4,X3))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_21]) ).
cnf(c_0_23,plain,
divide(divide(X1,X2),divide(X3,divide(divide(divide(X2,X1),inverse(X4)),inverse(X3)))) = X4,
inference(spm,[status(thm)],[c_0_22,c_0_22]) ).
cnf(c_0_24,plain,
divide(divide(X1,X2),inverse(divide(divide(X2,X1),divide(X3,divide(X4,inverse(X3)))))) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_4]) ).
cnf(c_0_25,plain,
divide(X1,divide(X2,inverse(X1))) = divide(X3,divide(X2,inverse(X3))),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_26,plain,
divide(divide(divide(divide(divide(X1,inverse(X2)),X2),X3),inverse(divide(X3,X4))),inverse(X4)) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_27,plain,
divide(divide(X1,inverse(X2)),X2) = divide(divide(X1,inverse(X3)),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_25]),c_0_7]) ).
cnf(c_0_28,plain,
divide(divide(X1,divide(divide(X2,inverse(X3)),X3)),divide(X4,X2)) = divide(X1,X4),
inference(spm,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_29,plain,
divide(divide(X1,X2),divide(X3,divide(divide(divide(X2,X1),inverse(X4)),X4))) = inverse(X3),
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_30,plain,
divide(inverse(divide(X1,X2)),inverse(X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_28]),c_0_29]) ).
cnf(c_0_31,plain,
divide(inverse(X1),inverse(inverse(divide(X2,X1)))) = inverse(X2),
inference(spm,[status(thm)],[c_0_30,c_0_30]) ).
cnf(c_0_32,plain,
inverse(inverse(divide(X1,divide(X2,inverse(inverse(X2)))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_28]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_34,plain,
divide(inverse(divide(inverse(divide(X1,divide(X2,divide(X3,inverse(X2))))),divide(X4,X1))),X3) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_24]),c_0_3]) ).
cnf(c_0_35,plain,
divide(inverse(divide(X1,inverse(inverse(X1)))),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
inverse(divide(X1,divide(X2,inverse(X1)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_28]),c_0_29]) ).
cnf(c_0_37,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
c_0_33 ).
cnf(c_0_38,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_39,plain,
divide(X1,X1) = inverse(divide(X2,inverse(inverse(X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_30]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_38]) ).
cnf(c_0_41,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_39]),c_0_32]) ).
cnf(c_0_42,plain,
divide(X1,divide(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_39]),c_0_35]),c_0_30]) ).
cnf(c_0_43,negated_conjecture,
inverse(inverse(a2)) != a2,
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_41]),c_0_42]),c_0_30]),c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP470-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n015.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 20:17:36 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.54/0.54 % Version: 3.5.1
% 0.54/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.54/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.54/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.54/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.54/0.54 % Starting sh5l with 300s (1) cores
% 0.54/0.54 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3839739 completed with status 0
% 0.54/0.54 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.54/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.54/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.54/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.54 % No SInE strategy applied
% 0.54/0.54 % Search class: FUUPF-FFSF21-MFFFFFNN
% 0.54/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.54/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.54/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.54/0.54 % Starting new_bool_1 with 136s (1) cores
% 0.54/0.54 % SubtermCWHack with pid 3839743 completed with status 0
% 0.54/0.54 % Result found by SubtermCWHack
% 0.54/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.54/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.54/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.54 % No SInE strategy applied
% 0.54/0.54 % Search class: FUUPF-FFSF21-MFFFFFNN
% 0.54/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.54 % Preprocessing time : 0.001 s
% 0.54/0.54
% 0.54/0.54 % Proof found!
% 0.54/0.54 % SZS status Unsatisfiable
% 0.54/0.54 % SZS output start CNFRefutation
% See solution above
% 0.54/0.54 % Parsed axioms : 3
% 0.54/0.54 % Removed by relevancy pruning/SinE : 0
% 0.54/0.54 % Initial clauses : 3
% 0.54/0.54 % Removed in clause preprocessing : 1
% 0.54/0.54 % Initial clauses in saturation : 2
% 0.54/0.54 % Processed clauses : 117
% 0.54/0.54 % ...of these trivial : 23
% 0.54/0.54 % ...subsumed : 40
% 0.54/0.54 % ...remaining for further processing : 54
% 0.54/0.54 % Other redundant clauses eliminated : 0
% 0.54/0.54 % Clauses deleted for lack of memory : 0
% 0.54/0.54 % Backward-subsumed : 0
% 0.54/0.54 % Backward-rewritten : 16
% 0.54/0.54 % Generated clauses : 6850
% 0.54/0.54 % ...of the previous two non-redundant : 6425
% 0.54/0.54 % ...aggressively subsumed : 0
% 0.54/0.54 % Contextual simplify-reflections : 0
% 0.54/0.54 % Paramodulations : 6850
% 0.54/0.54 % Factorizations : 0
% 0.54/0.54 % NegExts : 0
% 0.54/0.54 % Equation resolutions : 0
% 0.54/0.54 % Disequality decompositions : 0
% 0.54/0.54 % Total rewrite steps : 1444
% 0.54/0.54 % ...of those cached : 692
% 0.54/0.54 % Propositional unsat checks : 0
% 0.54/0.54 % Propositional check models : 0
% 0.54/0.54 % Propositional check unsatisfiable : 0
% 0.54/0.54 % Propositional clauses : 0
% 0.54/0.54 % Propositional clauses after purity: 0
% 0.54/0.54 % Propositional unsat core size : 0
% 0.54/0.54 % Propositional preprocessing time : 0.000
% 0.54/0.54 % Propositional encoding time : 0.000
% 0.54/0.54 % Propositional solver time : 0.000
% 0.54/0.54 % Success case prop preproc time : 0.000
% 0.54/0.54 % Success case prop encoding time : 0.000
% 0.54/0.54 % Success case prop solver time : 0.000
% 0.54/0.54 % Current number of processed clauses : 38
% 0.54/0.54 % Positive orientable unit clauses : 31
% 0.54/0.54 % Positive unorientable unit clauses: 7
% 0.54/0.54 % Negative unit clauses : 0
% 0.54/0.54 % Non-unit-clauses : 0
% 0.54/0.54 % Current number of unprocessed clauses: 6274
% 0.54/0.54 % ...number of literals in the above : 6274
% 0.54/0.54 % Current number of archived formulas : 0
% 0.54/0.54 % Current number of archived clauses : 17
% 0.54/0.54 % Clause-clause subsumption calls (NU) : 0
% 0.54/0.54 % Rec. Clause-clause subsumption calls : 0
% 0.54/0.54 % Non-unit clause-clause subsumptions : 0
% 0.54/0.54 % Unit Clause-clause subsumption calls : 132
% 0.54/0.54 % Rewrite failures with RHS unbound : 188
% 0.54/0.54 % BW rewrite match attempts : 463
% 0.54/0.54 % BW rewrite match successes : 40
% 0.54/0.54 % Condensation attempts : 0
% 0.54/0.54 % Condensation successes : 0
% 0.54/0.54 % Termbank termtop insertions : 104733
% 0.54/0.54 % Search garbage collected termcells : 2
% 0.54/0.54
% 0.54/0.54 % -------------------------------------------------
% 0.54/0.54 % User time : 0.090 s
% 0.54/0.54 % System time : 0.009 s
% 0.54/0.54 % Total time : 0.099 s
% 0.54/0.54 % Maximum resident set size: 3600 pages
% 0.54/0.54
% 0.54/0.54 % -------------------------------------------------
% 0.54/0.54 % User time : 0.399 s
% 0.54/0.54 % System time : 0.048 s
% 0.54/0.54 % Total time : 0.448 s
% 0.54/0.54 % Maximum resident set size: 4864 pages
% 0.54/0.54 % E exiting
%------------------------------------------------------------------------------