%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP523-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 : 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:40:10 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of clauses : 42 ( 42 unt; 0 nHn; 5 RR)
% Number of literals : 42 ( 41 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 83 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(inverse,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(single_axiom,axiom,
divide(X1,divide(X2,divide(X3,divide(X1,X2)))) = X3,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_4,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
inverse ).
cnf(c_0_5,plain,
divide(inverse(divide(X1,X1)),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_6,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_7,plain,
divide(inverse(inverse(divide(X1,X1))),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_5]),c_0_7]) ).
cnf(c_0_9,plain,
divide(multiply(inverse(X1),X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,axiom,
divide(X1,divide(X2,divide(X3,divide(X1,X2)))) = X3,
single_axiom ).
cnf(c_0_11,plain,
multiply(multiply(inverse(X1),X1),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
inverse(divide(X1,multiply(X2,X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_10]),c_0_7]),c_0_8]) ).
cnf(c_0_13,plain,
multiply(X1,divide(X2,multiply(X3,X2))) = divide(X1,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_10]),c_0_6]) ).
cnf(c_0_14,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,plain,
inverse(multiply(X1,inverse(X1))) = divide(X2,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_14]),c_0_8]) ).
cnf(c_0_16,plain,
divide(X1,X1) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_17,plain,
divide(X1,X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_8,c_0_16]) ).
cnf(c_0_18,plain,
inverse(divide(X1,divide(X2,X2))) = inverse(X1),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_19,plain,
divide(divide(divide(X1,X1),divide(X2,X2)),X3) = inverse(X3),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_20,plain,
inverse(inverse(multiply(X1,divide(X2,X2)))) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_4]) ).
cnf(c_0_21,plain,
inverse(multiply(X1,divide(X2,X2))) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_18]),c_0_8]) ).
cnf(c_0_22,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
divide(X1,divide(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_18]),c_0_22]) ).
cnf(c_0_24,plain,
multiply(X1,divide(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_23]),c_0_6]) ).
cnf(c_0_25,plain,
divide(X1,divide(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
cnf(c_0_26,plain,
multiply(divide(X1,X2),X2) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
divide(multiply(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_24]) ).
cnf(c_0_28,plain,
divide(X1,multiply(X1,X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_25,c_0_8]) ).
cnf(c_0_29,plain,
multiply(X1,inverse(X2)) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_30,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_33,plain,
multiply(inverse(X1),X2) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
multiply(divide(X1,X2),X3) = divide(X1,divide(X2,X3)),
inference(spm,[status(thm)],[c_0_10,c_0_27]) ).
cnf(c_0_35,plain,
inverse(multiply(X1,X2)) = divide(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_31,c_0_8]) ).
cnf(c_0_36,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_32 ).
cnf(c_0_37,plain,
divide(X1,divide(X2,X3)) = divide(X3,divide(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_34]) ).
cnf(c_0_38,plain,
divide(X1,divide(inverse(X2),X3)) = multiply(X1,multiply(X3,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_40,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP523-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n009.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.38 % DateTime : Sun Sep 20 20:15:50 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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.15/5.45 % Version: 3.5.1
% 0.15/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.45 % Starting sh5l with 300s (1) cores
% 0.15/5.45 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4150170 completed with status 0
% 0.15/5.45 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.45 % No SInE strategy applied
% 0.15/5.45 % Search class: FUUPS-FFSF21-MFFFFFNN
% 0.15/5.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/5.45 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/5.45 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/5.45 % Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/5.45 % G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 4150177 completed with status 0
% 0.15/5.45 % Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 0.15/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.45 % No SInE strategy applied
% 0.15/5.45 % Search class: FUUPS-FFSF21-MFFFFFNN
% 0.15/5.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/5.45 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/5.45 % Preprocessing time : 0.001 s
% 0.15/5.45 % Presaturation interreduction done
% 0.15/5.45
% 0.15/5.45 % Proof found!
% 0.15/5.45 % SZS status Unsatisfiable
% 0.15/5.45 % SZS output start CNFRefutation
% See solution above
% 0.15/5.45 % Parsed axioms : 4
% 0.15/5.45 % Removed by relevancy pruning/SinE : 0
% 0.15/5.45 % Initial clauses : 4
% 0.15/5.45 % Removed in clause preprocessing : 0
% 0.15/5.45 % Initial clauses in saturation : 4
% 0.15/5.45 % Processed clauses : 194
% 0.15/5.45 % ...of these trivial : 39
% 0.15/5.45 % ...subsumed : 95
% 0.15/5.45 % ...remaining for further processing : 60
% 0.15/5.45 % Other redundant clauses eliminated : 0
% 0.15/5.45 % Clauses deleted for lack of memory : 0
% 0.15/5.45 % Backward-subsumed : 1
% 0.15/5.45 % Backward-rewritten : 32
% 0.15/5.45 % Generated clauses : 1309
% 0.15/5.45 % ...of the previous two non-redundant : 975
% 0.15/5.45 % ...aggressively subsumed : 0
% 0.15/5.45 % Contextual simplify-reflections : 0
% 0.15/5.45 % Paramodulations : 1309
% 0.15/5.45 % Factorizations : 0
% 0.15/5.45 % NegExts : 0
% 0.15/5.45 % Equation resolutions : 0
% 0.15/5.45 % Disequality decompositions : 0
% 0.15/5.45 % Total rewrite steps : 1077
% 0.15/5.45 % ...of those cached : 680
% 0.15/5.45 % Propositional unsat checks : 0
% 0.15/5.45 % Propositional check models : 0
% 0.15/5.45 % Propositional check unsatisfiable : 0
% 0.15/5.45 % Propositional clauses : 0
% 0.15/5.45 % Propositional clauses after purity: 0
% 0.15/5.45 % Propositional unsat core size : 0
% 0.15/5.45 % Propositional preprocessing time : 0.000
% 0.15/5.45 % Propositional encoding time : 0.000
% 0.15/5.45 % Propositional solver time : 0.000
% 0.15/5.45 % Success case prop preproc time : 0.000
% 0.15/5.45 % Success case prop encoding time : 0.000
% 0.15/5.45 % Success case prop solver time : 0.000
% 0.15/5.45 % Current number of processed clauses : 23
% 0.15/5.45 % Positive orientable unit clauses : 17
% 0.15/5.45 % Positive unorientable unit clauses: 6
% 0.15/5.45 % Negative unit clauses : 0
% 0.15/5.45 % Non-unit-clauses : 0
% 0.15/5.45 % Current number of unprocessed clauses: 701
% 0.15/5.45 % ...number of literals in the above : 701
% 0.15/5.45 % Current number of archived formulas : 0
% 0.15/5.45 % Current number of archived clauses : 37
% 0.15/5.45 % Clause-clause subsumption calls (NU) : 0
% 0.15/5.45 % Rec. Clause-clause subsumption calls : 0
% 0.15/5.45 % Non-unit clause-clause subsumptions : 0
% 0.15/5.45 % Unit Clause-clause subsumption calls : 40
% 0.15/5.45 % Rewrite failures with RHS unbound : 158
% 0.15/5.45 % BW rewrite match attempts : 207
% 0.15/5.45 % BW rewrite match successes : 99
% 0.15/5.45 % Condensation attempts : 0
% 0.15/5.45 % Condensation successes : 0
% 0.15/5.45 % Termbank termtop insertions : 8144
% 0.15/5.45 % Search garbage collected termcells : 2
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.009 s
% 0.15/5.45 % System time : 0.002 s
% 0.15/5.45 % Total time : 0.012 s
% 0.15/5.45 % Maximum resident set size: 3632 pages
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.041 s
% 0.15/5.45 % System time : 0.014 s
% 0.15/5.45 % Total time : 0.054 s
% 0.15/5.45 % Maximum resident set size: 4864 pages
% 0.15/5.45 % E exiting
%------------------------------------------------------------------------------