%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP584-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:18 PM UTC 2026
% Result : Unsatisfiable 0.08s 0.35s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 7 RR)
% Number of literals : 18 ( 17 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_4,plain,
double_divide(X1,X2) = double_divide(X2,X1) ).
cnf(c_0_5,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_6,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_7,plain,
identity = double_divide(X1,double_divide(X1,identity)),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
multiply(a,b) != multiply(b,a),
inference(fof_simplification,[status(thm)],[prove_these_axioms_4]) ).
cnf(c_0_9,plain,
double_divide(identity,identity) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7]),c_0_7]) ).
cnf(c_0_10,negated_conjecture,
multiply(a,b) != multiply(b,a),
c_0_8 ).
cnf(c_0_11,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_12,plain,
double_divide(double_divide(double_divide(X1,identity),identity),identity) = double_divide(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9]),c_0_9]) ).
cnf(c_0_13,plain,
double_divide(double_divide(X1,identity),identity) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9]),c_0_9]) ).
cnf(c_0_14,negated_conjecture,
double_divide(double_divide(b,a),identity) != double_divide(double_divide(a,b),identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_15,plain,
double_divide(X1,identity) = double_divide(identity,X1),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
double_divide(identity,double_divide(a,b)) != double_divide(identity,double_divide(b,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_4])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP584-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.05/0.31 % Computer : n012.cluster.edu
% 0.05/0.31 % Model : x86_64 x86_64
% 0.05/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31 % Memory : 8046.5625MB
% 0.05/0.31 % OS : Linux 6.8.0-71-generic
% 0.05/0.31 % CPULimit : 300
% 0.05/0.31 % WCLimit : 300
% 0.05/0.31 % DateTime : Sun Sep 20 20:17:22 UTC 2026
% 0.05/0.31 % CPUTime :
% 0.05/0.31 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.33 Running first-order theorem proving
% 0.08/0.33 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.08/0.35 % Version: 3.5.1
% 0.08/0.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.35 % Starting sh5l with 300s (1) cores
% 0.08/0.35 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 783763 completed with status 0
% 0.08/0.35 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.08/0.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.35 % No SInE strategy applied
% 0.08/0.35 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.08/0.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.35 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.08/0.35 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 0.08/0.35 % Starting new_bool_3 with 136s (1) cores
% 0.08/0.35 % Starting new_bool_1 with 136s (1) cores
% 0.08/0.35 % G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with pid 783771 completed with status 0
% 0.08/0.35 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 0.08/0.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.35 % No SInE strategy applied
% 0.08/0.35 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.08/0.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.35 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.08/0.35 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 0.08/0.35 % Preprocessing time : 0.001 s
% 0.08/0.35 % Presaturation interreduction done
% 0.08/0.35
% 0.08/0.35 % Proof found!
% 0.08/0.35 % SZS status Unsatisfiable
% 0.08/0.35 % SZS output start CNFRefutation
% See solution above
% 0.08/0.35 % Parsed axioms : 5
% 0.08/0.35 % Removed by relevancy pruning/SinE : 0
% 0.08/0.35 % Initial clauses : 5
% 0.08/0.35 % Removed in clause preprocessing : 2
% 0.08/0.35 % Initial clauses in saturation : 3
% 0.08/0.35 % Processed clauses : 87
% 0.08/0.35 % ...of these trivial : 27
% 0.08/0.35 % ...subsumed : 14
% 0.08/0.35 % ...remaining for further processing : 46
% 0.08/0.35 % Other redundant clauses eliminated : 0
% 0.08/0.35 % Clauses deleted for lack of memory : 0
% 0.08/0.35 % Backward-subsumed : 1
% 0.08/0.35 % Backward-rewritten : 36
% 0.08/0.35 % Generated clauses : 658
% 0.08/0.35 % ...of the previous two non-redundant : 259
% 0.08/0.35 % ...aggressively subsumed : 0
% 0.08/0.35 % Contextual simplify-reflections : 0
% 0.08/0.35 % Paramodulations : 658
% 0.08/0.35 % Factorizations : 0
% 0.08/0.35 % NegExts : 0
% 0.08/0.35 % Equation resolutions : 0
% 0.08/0.35 % Disequality decompositions : 0
% 0.08/0.35 % Total rewrite steps : 1360
% 0.08/0.35 % ...of those cached : 1251
% 0.08/0.35 % Propositional unsat checks : 0
% 0.08/0.35 % Propositional check models : 0
% 0.08/0.35 % Propositional check unsatisfiable : 0
% 0.08/0.35 % Propositional clauses : 0
% 0.08/0.35 % Propositional clauses after purity: 0
% 0.08/0.35 % Propositional unsat core size : 0
% 0.08/0.35 % Propositional preprocessing time : 0.000
% 0.08/0.35 % Propositional encoding time : 0.000
% 0.08/0.35 % Propositional solver time : 0.000
% 0.08/0.35 % Success case prop preproc time : 0.000
% 0.08/0.35 % Success case prop encoding time : 0.000
% 0.08/0.35 % Success case prop solver time : 0.000
% 0.08/0.35 % Current number of processed clauses : 6
% 0.08/0.35 % Positive orientable unit clauses : 5
% 0.08/0.35 % Positive unorientable unit clauses: 1
% 0.08/0.35 % Negative unit clauses : 0
% 0.08/0.35 % Non-unit-clauses : 0
% 0.08/0.35 % Current number of unprocessed clauses: 177
% 0.08/0.35 % ...number of literals in the above : 177
% 0.08/0.35 % Current number of archived formulas : 0
% 0.08/0.35 % Current number of archived clauses : 42
% 0.08/0.35 % Clause-clause subsumption calls (NU) : 0
% 0.08/0.35 % Rec. Clause-clause subsumption calls : 0
% 0.08/0.35 % Non-unit clause-clause subsumptions : 0
% 0.08/0.35 % Unit Clause-clause subsumption calls : 11
% 0.08/0.35 % Rewrite failures with RHS unbound : 0
% 0.08/0.35 % BW rewrite match attempts : 1169
% 0.08/0.35 % BW rewrite match successes : 75
% 0.08/0.35 % Condensation attempts : 0
% 0.08/0.35 % Condensation successes : 0
% 0.08/0.35 % Termbank termtop insertions : 8151
% 0.08/0.35 % Search garbage collected termcells : 2
% 0.08/0.35
% 0.08/0.35 % -------------------------------------------------
% 0.08/0.35 % User time : 0.004 s
% 0.08/0.35 % System time : 0.002 s
% 0.08/0.35 % Total time : 0.006 s
% 0.08/0.35 % Maximum resident set size: 3608 pages
% 0.08/0.35
% 0.08/0.35 % -------------------------------------------------
% 0.08/0.35 % User time : 0.022 s
% 0.08/0.35 % System time : 0.008 s
% 0.08/0.35 % Total time : 0.029 s
% 0.08/0.35 % Maximum resident set size: 4864 pages
% 0.08/0.35 % E exiting
%------------------------------------------------------------------------------