↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ALG377-1 : TPTP v9.3.1. Released v4.1.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 11:56:00 AM UTC 2026

% Result   : Unsatisfiable 0.22s 10.70s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   13 (  10 unt;   0 nHn;   8 RR)
%            Number of literals    :   16 (   2 equ;   7 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-3 aty)
%            Number of variables   :   13 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    ~ c_lessequals(c_HOL_Oplus__class_Oplus(c_HOL_Ouminus__class_Ouminus(v_s____,tc_RealDef_Oreal),c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_Suc(v_f____(c_HOL_Oplus__class_Oplus(v_N1____,v_N2____,tc_nat))),tc_nat),tc_RealDef_Oreal),tc_RealDef_Oreal),c_HOL_Oplus__class_Oplus(c_HOL_Ouminus__class_Ouminus(v_s____,tc_RealDef_Oreal),c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_Suc(c_HOL_Oplus__class_Oplus(v_N1____,v_N2____,tc_nat)),tc_nat),tc_RealDef_Oreal),tc_RealDef_Oreal),tc_RealDef_Oreal),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_add__Suc__right_0,axiom,
    c_HOL_Oplus__class_Oplus(X1,c_Suc(X2),tc_nat) = c_Suc(c_HOL_Oplus__class_Oplus(X1,X2,tc_nat)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_add__Suc__right_0) ).

cnf(cls_real__add__left__mono_0,axiom,
    ( ~ c_lessequals(X2,X3,tc_RealDef_Oreal)
    | c_lessequals(c_HOL_Oplus__class_Oplus(X1,X2,tc_RealDef_Oreal),c_HOL_Oplus__class_Oplus(X1,X3,tc_RealDef_Oreal),tc_RealDef_Oreal) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_real__add__left__mono_0) ).

cnf(cls_CHAINED_0,axiom,
    c_lessequals(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_Suc(v_f____(c_HOL_Oplus__class_Oplus(v_N1____,v_N2____,tc_nat))),tc_nat),tc_RealDef_Oreal),c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_Suc(c_HOL_Oplus__class_Oplus(v_N1____,v_N2____,tc_nat)),tc_nat),tc_RealDef_Oreal),tc_RealDef_Oreal),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_CHAINED_0) ).

cnf(c_0_4,negated_conjecture,
    ~ c_lessequals(c_HOL_Oplus__class_Oplus(c_HOL_Ouminus__class_Ouminus(v_s____,tc_RealDef_Oreal),c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_Suc(v_f____(c_HOL_Oplus__class_Oplus(v_N1____,v_N2____,tc_nat))),tc_nat),tc_RealDef_Oreal),tc_RealDef_Oreal),c_HOL_Oplus__class_Oplus(c_HOL_Ouminus__class_Ouminus(v_s____,tc_RealDef_Oreal),c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_Suc(c_HOL_Oplus__class_Oplus(v_N1____,v_N2____,tc_nat)),tc_nat),tc_RealDef_Oreal),tc_RealDef_Oreal),tc_RealDef_Oreal),
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_5,negated_conjecture,
    ~ c_lessequals(c_HOL_Oplus__class_Oplus(c_HOL_Ouminus__class_Ouminus(v_s____,tc_RealDef_Oreal),c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_Suc(v_f____(c_HOL_Oplus__class_Oplus(v_N1____,v_N2____,tc_nat))),tc_nat),tc_RealDef_Oreal),tc_RealDef_Oreal),c_HOL_Oplus__class_Oplus(c_HOL_Ouminus__class_Ouminus(v_s____,tc_RealDef_Oreal),c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_Suc(c_HOL_Oplus__class_Oplus(v_N1____,v_N2____,tc_nat)),tc_nat),tc_RealDef_Oreal),tc_RealDef_Oreal),tc_RealDef_Oreal),
    c_0_4 ).

cnf(c_0_6,axiom,
    c_HOL_Oplus__class_Oplus(X1,c_Suc(X2),tc_nat) = c_Suc(c_HOL_Oplus__class_Oplus(X1,X2,tc_nat)),
    cls_add__Suc__right_0 ).

cnf(c_0_7,plain,
    ( ~ c_lessequals(X2,X3,tc_RealDef_Oreal)
    | c_lessequals(c_HOL_Oplus__class_Oplus(X1,X2,tc_RealDef_Oreal),c_HOL_Oplus__class_Oplus(X1,X3,tc_RealDef_Oreal),tc_RealDef_Oreal) ),
    inference(fof_simplification,[status(thm)],[cls_real__add__left__mono_0]) ).

cnf(c_0_8,axiom,
    c_lessequals(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_Suc(v_f____(c_HOL_Oplus__class_Oplus(v_N1____,v_N2____,tc_nat))),tc_nat),tc_RealDef_Oreal),c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_Suc(c_HOL_Oplus__class_Oplus(v_N1____,v_N2____,tc_nat)),tc_nat),tc_RealDef_Oreal),tc_RealDef_Oreal),
    cls_CHAINED_0 ).

cnf(c_0_9,negated_conjecture,
    ~ c_lessequals(c_HOL_Oplus__class_Oplus(c_HOL_Ouminus__class_Ouminus(v_s____,tc_RealDef_Oreal),c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_Suc(v_f____(c_HOL_Oplus__class_Oplus(v_N1____,v_N2____,tc_nat))),tc_nat),tc_RealDef_Oreal),tc_RealDef_Oreal),c_HOL_Oplus__class_Oplus(c_HOL_Ouminus__class_Ouminus(v_s____,tc_RealDef_Oreal),c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_HOL_Oplus__class_Oplus(v_N1____,c_Suc(v_N2____),tc_nat),tc_nat),tc_RealDef_Oreal),tc_RealDef_Oreal),tc_RealDef_Oreal),
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_10,plain,
    ( ~ c_lessequals(X2,X3,tc_RealDef_Oreal)
    | c_lessequals(c_HOL_Oplus__class_Oplus(X1,X2,tc_RealDef_Oreal),c_HOL_Oplus__class_Oplus(X1,X3,tc_RealDef_Oreal),tc_RealDef_Oreal) ),
    c_0_7 ).

cnf(c_0_11,plain,
    c_lessequals(c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_Suc(v_f____(c_HOL_Oplus__class_Oplus(v_N1____,v_N2____,tc_nat))),tc_nat),tc_RealDef_Oreal),c_HOL_Oinverse__class_Odivide(c_HOL_Oone__class_Oone(tc_RealDef_Oreal),c_RealDef_Oreal(c_HOL_Oplus__class_Oplus(v_N1____,c_Suc(v_N2____),tc_nat),tc_nat),tc_RealDef_Oreal),tc_RealDef_Oreal),
    inference(rw,[status(thm)],[c_0_8,c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : ALG377-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/10.45  % Computer : n004.cluster.edu
% 0.17/10.45  % Model    : x86_64 x86_64
% 0.17/10.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/10.45  % Memory   : 8046.5625MB
% 0.17/10.45  % OS       : Linux 6.8.0-71-generic
% 0.17/10.45  % CPULimit : 300
% 0.17/10.45  % WCLimit  : 300
% 0.17/10.45  % DateTime : Mon Sep 21 13:18:15 UTC 2026
% 0.17/10.46  % CPUTime  : 
% 0.17/10.46  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/10.51  Running first-order theorem proving
% 0.22/10.51  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.22/10.70  % Version: 3.5.1
% 0.22/10.70  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/10.70  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/10.70  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/10.70  % Starting new_bool_3 with 300s (1) cores
% 0.22/10.70  % Starting new_bool_1 with 300s (1) cores
% 0.22/10.70  % Starting sh5l with 300s (1) cores
% 0.22/10.70  % new_bool_1 with pid 3220778 completed with status 0
% 0.22/10.70  % Result found by new_bool_1
% 0.22/10.70  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/10.70  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/10.70  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/10.70  % Starting new_bool_3 with 300s (1) cores
% 0.22/10.70  % Starting new_bool_1 with 300s (1) cores
% 0.22/10.70  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/10.70  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/10.70  % Search class: FGHSM-FSLM31-DFFFFFNN
% 0.22/10.70  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/10.70  % Starting SubtermCWHack with 28s (1) cores
% 0.22/10.70  % SubtermCWHack with pid 3220786 completed with status 0
% 0.22/10.70  % Result found by SubtermCWHack
% 0.22/10.70  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/10.70  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/10.70  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/10.70  % Starting new_bool_3 with 300s (1) cores
% 0.22/10.70  % Starting new_bool_1 with 300s (1) cores
% 0.22/10.70  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/10.70  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/10.70  % Search class: FGHSM-FSLM31-DFFFFFNN
% 0.22/10.70  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/10.70  % Starting SubtermCWHack with 28s (1) cores
% 0.22/10.70  % Preprocessing time       : 0.003 s
% 0.22/10.70  
% 0.22/10.70  % Proof found!
% 0.22/10.70  % SZS status Unsatisfiable
% 0.22/10.70  % SZS output start CNFRefutation
% See solution above
% 0.22/10.70  % Parsed axioms                        : 559
% 0.22/10.70  % Removed by relevancy pruning/SinE    : 353
% 0.22/10.71  % Initial clauses                      : 206
% 0.22/10.71  % Removed in clause preprocessing      : 0
% 0.22/10.71  % Initial clauses in saturation        : 206
% 0.22/10.71  % Processed clauses                    : 1628
% 0.22/10.71  % ...of these trivial                  : 120
% 0.22/10.71  % ...subsumed                          : 1111
% 0.22/10.71  % ...remaining for further processing  : 397
% 0.22/10.71  % Other redundant clauses eliminated   : 24
% 0.22/10.71  % Clauses deleted for lack of memory   : 0
% 0.22/10.71  % Backward-subsumed                    : 0
% 0.22/10.71  % Backward-rewritten                   : 28
% 0.22/10.71  % Generated clauses                    : 6856
% 0.22/10.71  % ...of the previous two non-redundant : 5147
% 0.22/10.71  % ...aggressively subsumed             : 0
% 0.22/10.71  % Contextual simplify-reflections      : 0
% 0.22/10.71  % Paramodulations                      : 6812
% 0.22/10.71  % Factorizations                       : 14
% 0.22/10.71  % NegExts                              : 0
% 0.22/10.71  % Equation resolutions                 : 30
% 0.22/10.71  % Disequality decompositions           : 0
% 0.22/10.71  % Total rewrite steps                  : 6123
% 0.22/10.71  % ...of those cached                   : 5529
% 0.22/10.71  % Propositional unsat checks           : 0
% 0.22/10.71  %    Propositional check models        : 0
% 0.22/10.71  %    Propositional check unsatisfiable : 0
% 0.22/10.71  %    Propositional clauses             : 0
% 0.22/10.71  %    Propositional clauses after purity: 0
% 0.22/10.71  %    Propositional unsat core size     : 0
% 0.22/10.71  %    Propositional preprocessing time  : 0.000
% 0.22/10.71  %    Propositional encoding time       : 0.000
% 0.22/10.71  %    Propositional solver time         : 0.000
% 0.22/10.71  %    Success case prop preproc time    : 0.000
% 0.22/10.71  %    Success case prop encoding time   : 0.000
% 0.22/10.71  %    Success case prop solver time     : 0.000
% 0.22/10.71  % Current number of processed clauses  : 369
% 0.22/10.71  %    Positive orientable unit clauses  : 76
% 0.22/10.71  %    Positive unorientable unit clauses: 4
% 0.22/10.71  %    Negative unit clauses             : 74
% 0.22/10.71  %    Non-unit-clauses                  : 215
% 0.22/10.71  % Current number of unprocessed clauses: 3630
% 0.22/10.71  % ...number of literals in the above   : 8721
% 0.22/10.71  % Current number of archived formulas  : 0
% 0.22/10.71  % Current number of archived clauses   : 28
% 0.22/10.71  % Clause-clause subsumption calls (NU) : 4210
% 0.22/10.71  % Rec. Clause-clause subsumption calls : 2837
% 0.22/10.71  % Non-unit clause-clause subsumptions  : 278
% 0.22/10.71  % Unit Clause-clause subsumption calls : 282
% 0.22/10.71  % Rewrite failures with RHS unbound    : 0
% 0.22/10.71  % BW rewrite match attempts            : 158
% 0.22/10.71  % BW rewrite match successes           : 50
% 0.22/10.71  % Condensation attempts                : 0
% 0.22/10.71  % Condensation successes               : 0
% 0.22/10.71  % Termbank termtop insertions          : 98358
% 0.22/10.71  % Search garbage collected termcells   : 1527
% 0.22/10.71  
% 0.22/10.71  % -------------------------------------------------
% 0.22/10.71  % User time                : 0.092 s
% 0.22/10.71  % System time              : 0.010 s
% 0.22/10.71  % Total time               : 0.101 s
% 0.22/10.71  % Maximum resident set size: 4216 pages
% 0.22/10.71  
% 0.22/10.71  % -------------------------------------------------
% 0.22/10.71  % User time                : 0.114 s
% 0.22/10.71  % System time              : 0.016 s
% 0.22/10.71  % Total time               : 0.130 s
% 0.22/10.71  % Maximum resident set size: 4864 pages
% 0.22/10.71  % E exiting
%------------------------------------------------------------------------------