↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWV413+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 05:22:07 PM UTC 2026

% Result   : Theorem 1.25s 1.72s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   3 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   31 (  11   ~;   7   |;  10   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn  17   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(l49_co,conjecture,
    ! [X1,X2,X3,X4] :
      ( ( pair_in_list(X1,X2,X3)
        & strictly_less_than(X2,X4)
        & less_than(X4,X3) )
     => ? [X5] :
          ( pair_in_list(update_slb(X1,X4),X2,X5)
          & less_than(X4,X5) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l49_co) ).

fof(l49_li3637,lemma,
    ! [X1,X2,X3,X4] :
      ( ( pair_in_list(X1,X2,X3)
        & less_than(X4,X3) )
     => pair_in_list(update_slb(X1,X4),X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l49_li3637) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2,X3,X4] :
        ( ( pair_in_list(X1,X2,X3)
          & strictly_less_than(X2,X4)
          & less_than(X4,X3) )
       => ? [X5] :
            ( pair_in_list(update_slb(X1,X4),X2,X5)
            & less_than(X4,X5) ) ),
    inference(assume_negation,[status(cth)],[l49_co]) ).

fof(c_0_3,negated_conjecture,
    ! [X117] :
      ( pair_in_list(esk1_0,esk2_0,esk3_0)
      & strictly_less_than(esk2_0,esk4_0)
      & less_than(esk4_0,esk3_0)
      & ( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,X117)
        | ~ less_than(esk4_0,X117) ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

fof(c_0_4,lemma,
    ! [X109,X110,X111,X112] :
      ( ~ pair_in_list(X109,X110,X111)
      | ~ less_than(X112,X111)
      | pair_in_list(update_slb(X109,X112),X110,X111) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l49_li3637])]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ pair_in_list(update_slb(esk1_0,esk4_0),esk2_0,X1)
    | ~ less_than(esk4_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,lemma,
    ( pair_in_list(update_slb(X1,X4),X2,X3)
    | ~ pair_in_list(X1,X2,X3)
    | ~ less_than(X4,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ pair_in_list(esk1_0,esk2_0,X1)
    | ~ less_than(esk4_0,X1) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    pair_in_list(esk1_0,esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_9,negated_conjecture,
    less_than(esk4_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWV413+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33  % Computer : n005.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Tue May  5 05:06:00 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.25/1.72  % Version  : CSE_E---1.7
% 1.25/1.72  % Problem  : theBenchmark.p
% 1.25/1.72  % SZS status Theorem for theBenchmark.p
% 1.25/1.72  % SZS output start CNFRefutation
% See solution above
% 1.25/1.72  % Total time : 1.372s
%------------------------------------------------------------------------------