%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP533-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:44:11 PM UTC 2026
% Result : Unsatisfiable 0.14s 5.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 4 RR)
% Number of literals : 23 ( 22 equ; 3 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(single_axiom,axiom,
divide(divide(X1,divide(divide(X1,X2),X3)),X2) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c_0_4,axiom,
multiply(X1,X2) = divide(X1,divide(divide(X3,X3),X2)),
multiply ).
cnf(c_0_5,axiom,
inverse(X1) = divide(divide(X2,X2),X1),
inverse ).
cnf(c_0_6,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,axiom,
divide(divide(X1,divide(divide(X1,X2),X3)),X2) = X3,
single_axiom ).
cnf(c_0_8,plain,
divide(multiply(inverse(X1),X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
divide(multiply(X1,X2),X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_6]) ).
cnf(c_0_10,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
multiply(divide(X1,X1),X2) = X2,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_14,plain,
divide(X1,divide(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_13]) ).
cnf(c_0_15,plain,
divide(multiply(X1,X2),X2) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_16,plain,
multiply(X1,inverse(X2)) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_18,plain,
multiply(divide(X1,X2),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_6]) ).
cnf(c_0_19,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_17 ).
cnf(c_0_20,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_21,plain,
divide(X1,X1) = divide(X2,X2),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_16]),c_0_20]),c_0_16]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP533-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/5.37 % Computer : n004.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.37 % DateTime : Sun Sep 20 20:16:09 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.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.14/5.45 % Version: 3.5.1
% 0.14/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.45 % Starting sh5l with 300s (1) cores
% 0.14/5.45 % new_bool_3 with pid 1397034 completed with status 0
% 0.14/5.45 % Result found by new_bool_3
% 0.14/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.45 % Search class: FUUPS-FFSF21-MFFFFFNN
% 0.14/5.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.45 % Starting SubtermCWHack with 28s (1) cores
% 0.14/5.45 % SubtermCWHack with pid 1397040 completed with status 0
% 0.14/5.45 % Result found by SubtermCWHack
% 0.14/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.45 % Search class: FUUPS-FFSF21-MFFFFFNN
% 0.14/5.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.45 % Starting SubtermCWHack with 28s (1) cores
% 0.14/5.45 % Preprocessing time : 0.001 s
% 0.14/5.45
% 0.14/5.45 % Proof found!
% 0.14/5.45 % SZS status Unsatisfiable
% 0.14/5.45 % SZS output start CNFRefutation
% See solution above
% 0.14/5.45 % Parsed axioms : 5
% 0.14/5.45 % Removed by relevancy pruning/SinE : 1
% 0.14/5.45 % Initial clauses : 4
% 0.14/5.45 % Removed in clause preprocessing : 0
% 0.14/5.45 % Initial clauses in saturation : 4
% 0.14/5.45 % Processed clauses : 38
% 0.14/5.45 % ...of these trivial : 3
% 0.14/5.45 % ...subsumed : 11
% 0.14/5.45 % ...remaining for further processing : 24
% 0.14/5.45 % Other redundant clauses eliminated : 0
% 0.14/5.45 % Clauses deleted for lack of memory : 0
% 0.14/5.45 % Backward-subsumed : 0
% 0.14/5.45 % Backward-rewritten : 8
% 0.14/5.45 % Generated clauses : 210
% 0.14/5.45 % ...of the previous two non-redundant : 138
% 0.14/5.45 % ...aggressively subsumed : 0
% 0.14/5.45 % Contextual simplify-reflections : 0
% 0.14/5.45 % Paramodulations : 210
% 0.14/5.45 % Factorizations : 0
% 0.14/5.45 % NegExts : 0
% 0.14/5.45 % Equation resolutions : 0
% 0.14/5.45 % Disequality decompositions : 0
% 0.14/5.45 % Total rewrite steps : 137
% 0.14/5.45 % ...of those cached : 78
% 0.14/5.45 % Propositional unsat checks : 0
% 0.14/5.45 % Propositional check models : 0
% 0.14/5.45 % Propositional check unsatisfiable : 0
% 0.14/5.45 % Propositional clauses : 0
% 0.14/5.45 % Propositional clauses after purity: 0
% 0.14/5.45 % Propositional unsat core size : 0
% 0.14/5.45 % Propositional preprocessing time : 0.000
% 0.14/5.45 % Propositional encoding time : 0.000
% 0.14/5.45 % Propositional solver time : 0.000
% 0.14/5.45 % Success case prop preproc time : 0.000
% 0.14/5.45 % Success case prop encoding time : 0.000
% 0.14/5.45 % Success case prop solver time : 0.000
% 0.14/5.45 % Current number of processed clauses : 16
% 0.14/5.45 % Positive orientable unit clauses : 14
% 0.14/5.45 % Positive unorientable unit clauses: 2
% 0.14/5.45 % Negative unit clauses : 0
% 0.14/5.45 % Non-unit-clauses : 0
% 0.14/5.45 % Current number of unprocessed clauses: 91
% 0.14/5.45 % ...number of literals in the above : 91
% 0.14/5.45 % Current number of archived formulas : 0
% 0.14/5.45 % Current number of archived clauses : 8
% 0.14/5.45 % Clause-clause subsumption calls (NU) : 0
% 0.14/5.45 % Rec. Clause-clause subsumption calls : 0
% 0.14/5.45 % Non-unit clause-clause subsumptions : 0
% 0.14/5.45 % Unit Clause-clause subsumption calls : 5
% 0.14/5.45 % Rewrite failures with RHS unbound : 24
% 0.14/5.45 % BW rewrite match attempts : 62
% 0.14/5.45 % BW rewrite match successes : 30
% 0.14/5.45 % Condensation attempts : 0
% 0.14/5.45 % Condensation successes : 0
% 0.14/5.45 % Termbank termtop insertions : 1160
% 0.14/5.45 % Search garbage collected termcells : 5
% 0.14/5.45
% 0.14/5.45 % -------------------------------------------------
% 0.14/5.45 % User time : 0.006 s
% 0.14/5.45 % System time : 0.000 s
% 0.14/5.45 % Total time : 0.006 s
% 0.14/5.45 % Maximum resident set size: 3632 pages
% 0.14/5.45
% 0.14/5.45 % -------------------------------------------------
% 0.14/5.45 % User time : 0.008 s
% 0.14/5.45 % System time : 0.007 s
% 0.14/5.45 % Total time : 0.015 s
% 0.14/5.45 % Maximum resident set size: 4864 pages
% 0.14/5.45 % E exiting
%------------------------------------------------------------------------------