↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : COM213_1 : TPTP v9.3.1. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/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:11:44 PM UTC 2026

% Result   : Theorem 0.15s 5.44s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   29 (  16 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  19   ~;   4   |;   3   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-1 aty)
%            Number of variables   :   19 (   0 sgn  19   !;   0   ?;  19   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    vTy: $tType ).

tff(decl_sort2,type,
    vTerm: $tType ).

tff(decl_23,type,
    vNat: vTy ).

tff(decl_24,type,
    vSucc: vTerm > vTerm ).

tff(decl_25,type,
    vPred: vTerm > vTerm ).

tff(decl_27,type,
    vZero: vTerm ).

tff(decl_35,type,
    vt1: vTerm ).

tff(decl_37,type,
    visNV: vTerm > $o ).

tff(decl_41,type,
    vptchecksimple: ( vTy * vTerm ) > $o ).

tff(decl_66,type,
    esk24_1: vTerm > vTerm ).

tff('DIFF-Succ-Pred',axiom,
    ! [X2: vTerm,X3: vTerm] : ( vSucc(X2) != vPred(X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','DIFF-Succ-Pred') ).

tff('isNV-2',axiom,
    ! [X12: vTerm] :
      ( ( ! [X13: vTerm] : ( X12 != vSucc(X13) )
        & ( X12 != vZero ) )
     => ~ visNV(X12) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isNV-2') ).

tff('DIFF-Zero-Pred',axiom,
    ! [X2: vTerm] : ( vZero != vPred(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','DIFF-Zero-Pred') ).

tff('isNVisNat-Pred',conjecture,
    ( visNV(vPred(vt1))
   => vptchecksimple(vPred(vt1),vNat) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','isNVisNat-Pred') ).

tff(c_0_4,plain,
    ! [X2: vTerm,X3: vTerm] : ( vSucc(X2) != vPred(X3) ),
    inference(fof_simplification,[status(thm)],['DIFF-Succ-Pred']) ).

tff(c_0_5,plain,
    ! [X12: vTerm] :
      ( ( ! [X13: vTerm] : ( X12 != vSucc(X13) )
        & ( X12 != vZero ) )
     => ~ visNV(X12) ),
    inference(fof_simplification,[status(thm)],['isNV-2']) ).

tff(c_0_6,plain,
    ! [X2: vTerm] : ( vZero != vPred(X2) ),
    inference(fof_simplification,[status(thm)],['DIFF-Zero-Pred']) ).

tff(c_0_7,negated_conjecture,
    ~ ( visNV(vPred(vt1))
     => vptchecksimple(vPred(vt1),vNat) ),
    inference(assume_negation,[status(cth)],['isNVisNat-Pred']) ).

tff(c_0_8,plain,
    ! [X143: vTerm,X144: vTerm] : ( vSucc(X143) != vPred(X144) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_4])]) ).

tff(c_0_9,plain,
    ! [X170: vTerm] :
      ( ~ visNV(X170)
      | ( X170 = vSucc(esk24_1(X170)) )
      | ( X170 = vZero ) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

tff(c_0_10,plain,
    ! [X142: vTerm] : ( vZero != vPred(X142) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).

tff(c_0_11,negated_conjecture,
    ( ~ vptchecksimple(vPred(vt1),vNat)
    & visNV(vPred(vt1)) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).

tcf(c_0_12,plain,
    ! [X1: vTerm,X2: vTerm] : vSucc(X1) != vPred(X2),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

tcf(c_0_13,plain,
    ! [X1: vTerm] :
      ( ~ visNV(X1)
      | ( X1 = vSucc(esk24_1(X1)) )
      | ( X1 = vZero ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

tcf(c_0_14,plain,
    ! [X1: vTerm] : vZero != vPred(X1),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

tcf(c_0_15,negated_conjecture,
    visNV(vPred(vt1)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

tcf(c_0_16,plain,
    ! [X1: vTerm] : ~ visNV(vPred(X1)),
    inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]),c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_15,c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COM213_1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/5.37  % Computer : n008.cluster.edu
% 0.09/5.37  % Model    : x86_64 x86_64
% 0.09/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37  % Memory   : 8046.5625MB
% 0.09/5.37  % OS       : Linux 6.8.0-71-generic
% 0.09/5.37  % CPULimit : 300
% 0.09/5.37  % WCLimit  : 300
% 0.09/5.37  % DateTime : Mon Sep 21 14:21:00 UTC 2026
% 0.09/5.37  % CPUTime  : 
% 0.09/5.37  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.44  % Version: 3.5.1
% 0.15/5.44  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.44  % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44  % Starting new_bool_1 with 300s (1) cores
% 0.15/5.44  % Starting sh5l with 300s (1) cores
% 0.15/5.44  % new_bool_3 with pid 1206076 completed with status 0
% 0.15/5.44  % Result found by new_bool_3
% 0.15/5.44  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.44  % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.44  % Search class: FGUSS-FFMS31-MFFFFFNN
% 0.15/5.44  % partial match(1): FGUSS-FFMS31-DFFFFFNN
% 0.15/5.44  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.44  % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.44  % SubtermCWHack with pid 1206079 completed with status 0
% 0.15/5.44  % Result found by SubtermCWHack
% 0.15/5.44  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.44  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.44  % Starting new_bool_3 with 300s (1) cores
% 0.15/5.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.44  % Search class: FGUSS-FFMS31-MFFFFFNN
% 0.15/5.44  % partial match(1): FGUSS-FFMS31-DFFFFFNN
% 0.15/5.44  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.44  % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.44  % Preprocessing time       : 0.002 s
% 0.15/5.44  
% 0.15/5.44  % Proof found!
% 0.15/5.44  % SZS status Theorem
% 0.15/5.44  % SZS output start CNFRefutation
% See solution above
% 0.15/5.44  % Parsed axioms                        : 129
% 0.15/5.44  % Removed by relevancy pruning/SinE    : 52
% 0.15/5.44  % Initial clauses                      : 96
% 0.15/5.44  % Removed in clause preprocessing      : 0
% 0.15/5.44  % Initial clauses in saturation        : 96
% 0.15/5.44  % Processed clauses                    : 80
% 0.15/5.44  % ...of these trivial                  : 2
% 0.15/5.44  % ...subsumed                          : 4
% 0.15/5.44  % ...remaining for further processing  : 74
% 0.15/5.44  % Other redundant clauses eliminated   : 16
% 0.15/5.44  % Clauses deleted for lack of memory   : 0
% 0.15/5.44  % Backward-subsumed                    : 1
% 0.15/5.44  % Backward-rewritten                   : 0
% 0.15/5.44  % Generated clauses                    : 77
% 0.15/5.44  % ...of the previous two non-redundant : 37
% 0.15/5.44  % ...aggressively subsumed             : 0
% 0.15/5.44  % Contextual simplify-reflections      : 0
% 0.15/5.44  % Paramodulations                      : 56
% 0.15/5.44  % Factorizations                       : 0
% 0.15/5.44  % NegExts                              : 0
% 0.15/5.44  % Equation resolutions                 : 20
% 0.15/5.44  % Disequality decompositions           : 0
% 0.15/5.44  % Total rewrite steps                  : 24
% 0.15/5.44  % ...of those cached                   : 15
% 0.15/5.44  % Propositional unsat checks           : 0
% 0.15/5.44  %    Propositional check models        : 0
% 0.15/5.44  %    Propositional check unsatisfiable : 0
% 0.15/5.44  %    Propositional clauses             : 0
% 0.15/5.44  %    Propositional clauses after purity: 0
% 0.15/5.44  %    Propositional unsat core size     : 0
% 0.15/5.44  %    Propositional preprocessing time  : 0.000
% 0.15/5.44  %    Propositional encoding time       : 0.000
% 0.15/5.44  %    Propositional solver time         : 0.000
% 0.15/5.44  %    Success case prop preproc time    : 0.000
% 0.15/5.44  %    Success case prop encoding time   : 0.000
% 0.15/5.44  %    Success case prop solver time     : 0.000
% 0.15/5.44  % Current number of processed clauses  : 72
% 0.15/5.44  %    Positive orientable unit clauses  : 13
% 0.15/5.44  %    Positive unorientable unit clauses: 0
% 0.15/5.44  %    Negative unit clauses             : 37
% 0.15/5.44  %    Non-unit-clauses                  : 22
% 0.15/5.44  % Current number of unprocessed clauses: 53
% 0.15/5.44  % ...number of literals in the above   : 158
% 0.15/5.44  % Current number of archived formulas  : 0
% 0.15/5.44  % Current number of archived clauses   : 2
% 0.15/5.44  % Clause-clause subsumption calls (NU) : 84
% 0.15/5.44  % Rec. Clause-clause subsumption calls : 84
% 0.15/5.44  % Non-unit clause-clause subsumptions  : 2
% 0.15/5.44  % Unit Clause-clause subsumption calls : 164
% 0.15/5.44  % Rewrite failures with RHS unbound    : 0
% 0.15/5.44  % BW rewrite match attempts            : 0
% 0.15/5.44  % BW rewrite match successes           : 0
% 0.15/5.44  % Condensation attempts                : 0
% 0.15/5.44  % Condensation successes               : 0
% 0.15/5.44  % Termbank termtop insertions          : 6953
% 0.15/5.44  % Search garbage collected termcells   : 1780
% 0.15/5.44  
% 0.15/5.44  % -------------------------------------------------
% 0.15/5.44  % User time                : 0.008 s
% 0.15/5.44  % System time              : 0.005 s
% 0.15/5.44  % Total time               : 0.013 s
% 0.15/5.44  % Maximum resident set size: 4352 pages
% 0.15/5.44  
% 0.15/5.44  % -------------------------------------------------
% 0.15/5.44  % User time                : 0.010 s
% 0.15/5.44  % System time              : 0.008 s
% 0.15/5.44  % Total time               : 0.019 s
% 0.15/5.44  % Maximum resident set size: 5120 pages
% 0.15/5.44  % E exiting
%------------------------------------------------------------------------------