%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP491-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 : n008.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:56 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.67s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 10 RR)
% Number of literals : 23 ( 22 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_4,plain,
double_divide(double_divide(identity,X1),double_divide(identity,identity)) = double_divide(double_divide(X1,identity),identity) ).
cnf(single_axiom,axiom,
double_divide(double_divide(identity,X1),double_divide(identity,double_divide(double_divide(double_divide(X1,X2),identity),double_divide(X3,X2)))) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c_0_6,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_7,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_8,plain,
identity = double_divide(X1,double_divide(X1,identity)),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
multiply(identity,a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_10,plain,
double_divide(double_divide(double_divide(identity,identity),identity),identity) = identity,
inference(rw,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
double_divide(double_divide(identity,identity),identity) = double_divide(identity,identity),
inference(rw,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
multiply(identity,a2) != a2,
c_0_9 ).
cnf(c_0_13,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_14,plain,
double_divide(identity,identity) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_15,negated_conjecture,
double_divide(double_divide(a2,identity),identity) != a2,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
double_divide(double_divide(identity,X1),identity) = double_divide(double_divide(X1,identity),identity),
inference(rw,[status(thm)],[c_0_4,c_0_14]) ).
cnf(c_0_17,axiom,
double_divide(double_divide(identity,X1),double_divide(identity,double_divide(double_divide(double_divide(X1,X2),identity),double_divide(X3,X2)))) = X3,
single_axiom ).
cnf(c_0_18,negated_conjecture,
double_divide(double_divide(identity,a2),identity) != a2,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
double_divide(X1,identity) = double_divide(identity,X1),
inference(rw,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
double_divide(identity,double_divide(identity,a2)) != a2,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
double_divide(identity,double_divide(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP491-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.12/5.60 % Computer : n008.cluster.edu
% 0.12/5.60 % Model : x86_64 x86_64
% 0.12/5.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.60 % Memory : 8046.5625MB
% 0.12/5.60 % OS : Linux 6.8.0-71-generic
% 0.15/5.60 % CPULimit : 300
% 0.15/5.60 % WCLimit : 300
% 0.15/5.60 % DateTime : Sun Sep 20 20:15:45 UTC 2026
% 0.15/5.60 % CPUTime :
% 0.15/5.60 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.64 Running first-order theorem proving
% 0.15/5.64 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.15/5.67 % Version: 3.5.1
% 0.15/5.67 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.67 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.67 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.67 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.67 % Starting sh5l with 300s (1) cores
% 0.15/5.67 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3516996 completed with status 0
% 0.15/5.67 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/5.67 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.67 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.67 % No SInE strategy applied
% 0.15/5.67 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.15/5.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.67 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.67 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/5.67 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 0.15/5.67 % Starting new_bool_3 with 136s (1) cores
% 0.15/5.67 % Starting new_bool_1 with 136s (1) cores
% 0.15/5.67 % G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with pid 3517003 completed with status 0
% 0.15/5.67 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 0.15/5.67 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/5.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.67 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/5.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.67 % No SInE strategy applied
% 0.15/5.67 % Search class: FUUPS-FFSF22-MFFFFFNN
% 0.15/5.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.67 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.67 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/5.67 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 0.15/5.67 % Preprocessing time : 0.001 s
% 0.15/5.67 % Presaturation interreduction done
% 0.15/5.67
% 0.15/5.67 % Proof found!
% 0.15/5.67 % SZS status Unsatisfiable
% 0.15/5.67 % SZS output start CNFRefutation
% See solution above
% 0.15/5.67 % Parsed axioms : 5
% 0.15/5.67 % Removed by relevancy pruning/SinE : 0
% 0.15/5.67 % Initial clauses : 5
% 0.15/5.67 % Removed in clause preprocessing : 2
% 0.15/5.67 % Initial clauses in saturation : 3
% 0.15/5.67 % Processed clauses : 31
% 0.15/5.67 % ...of these trivial : 4
% 0.15/5.67 % ...subsumed : 6
% 0.15/5.67 % ...remaining for further processing : 21
% 0.15/5.67 % Other redundant clauses eliminated : 0
% 0.15/5.67 % Clauses deleted for lack of memory : 0
% 0.15/5.67 % Backward-subsumed : 0
% 0.15/5.67 % Backward-rewritten : 10
% 0.15/5.67 % Generated clauses : 127
% 0.15/5.67 % ...of the previous two non-redundant : 83
% 0.15/5.67 % ...aggressively subsumed : 0
% 0.15/5.67 % Contextual simplify-reflections : 0
% 0.15/5.67 % Paramodulations : 127
% 0.15/5.67 % Factorizations : 0
% 0.15/5.67 % NegExts : 0
% 0.15/5.67 % Equation resolutions : 0
% 0.15/5.67 % Disequality decompositions : 0
% 0.15/5.67 % Total rewrite steps : 131
% 0.15/5.67 % ...of those cached : 108
% 0.15/5.67 % Propositional unsat checks : 0
% 0.15/5.67 % Propositional check models : 0
% 0.15/5.67 % Propositional check unsatisfiable : 0
% 0.15/5.67 % Propositional clauses : 0
% 0.15/5.67 % Propositional clauses after purity: 0
% 0.15/5.67 % Propositional unsat core size : 0
% 0.15/5.67 % Propositional preprocessing time : 0.000
% 0.15/5.67 % Propositional encoding time : 0.000
% 0.15/5.67 % Propositional solver time : 0.000
% 0.15/5.67 % Success case prop preproc time : 0.000
% 0.15/5.67 % Success case prop encoding time : 0.000
% 0.15/5.67 % Success case prop solver time : 0.000
% 0.15/5.67 % Current number of processed clauses : 8
% 0.15/5.67 % Positive orientable unit clauses : 7
% 0.15/5.67 % Positive unorientable unit clauses: 1
% 0.15/5.67 % Negative unit clauses : 0
% 0.15/5.67 % Non-unit-clauses : 0
% 0.15/5.67 % Current number of unprocessed clauses: 57
% 0.15/5.67 % ...number of literals in the above : 57
% 0.15/5.67 % Current number of archived formulas : 0
% 0.15/5.67 % Current number of archived clauses : 15
% 0.15/5.67 % Clause-clause subsumption calls (NU) : 0
% 0.15/5.67 % Rec. Clause-clause subsumption calls : 0
% 0.15/5.67 % Non-unit clause-clause subsumptions : 0
% 0.15/5.67 % Unit Clause-clause subsumption calls : 3
% 0.15/5.67 % Rewrite failures with RHS unbound : 0
% 0.15/5.67 % BW rewrite match attempts : 266
% 0.15/5.67 % BW rewrite match successes : 18
% 0.15/5.67 % Condensation attempts : 0
% 0.15/5.67 % Condensation successes : 0
% 0.15/5.67 % Termbank termtop insertions : 1720
% 0.15/5.67 % Search garbage collected termcells : 2
% 0.15/5.67
% 0.15/5.67 % -------------------------------------------------
% 0.15/5.67 % User time : 0.004 s
% 0.15/5.67 % System time : 0.003 s
% 0.15/5.67 % Total time : 0.007 s
% 0.15/5.67 % Maximum resident set size: 3632 pages
% 0.15/5.67
% 0.15/5.67 % -------------------------------------------------
% 0.15/5.67 % User time : 0.018 s
% 0.15/5.67 % System time : 0.016 s
% 0.15/5.67 % Total time : 0.033 s
% 0.15/5.67 % Maximum resident set size: 4864 pages
% 0.15/5.67 % E exiting
%------------------------------------------------------------------------------