↑ Up

CSE_E---1.7.THM-CRf.s

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

% Computer : n013.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 04:36:51 PM UTC 2026

% Result   : Theorem 1.34s 1.74s
% Output   : CNFRefutation 1.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   39 (  17 unt;   0 def)
%            Number of atoms       :   88 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   83 (  34   ~;  26   |;  16   &)
%                                         (   5 <=>;   1  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   8 con; 0-2 aty)
%            Number of variables   :   78 (   7 sgn  36   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(completeness,axiom,
    ! [X9,X10] :
      ( model(X9,X10)
    <~> model(X9,not(X10)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',completeness) ).

fof(contradiction,axiom,
    ? [X10] :
    ! [X9] : ~ model(X9,X10),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',contradiction) ).

fof(thm,axiom,
    ! [X1,X2] :
      ( ! [X3] :
          ( model(X3,X1)
         => model(X3,X2) )
    <=> status(X1,X2,thm) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',thm) ).

fof(tautology,axiom,
    ? [X10] :
    ! [X9] : model(X9,X10),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',tautology) ).

fof(csa,axiom,
    ! [X1,X2] :
      ( ? [X3] :
          ( model(X3,X1)
          & model(X3,not(X2)) )
    <=> status(X1,X2,csa) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',csa) ).

fof(non_thm_spt,axiom,
    ? [X3,X1,X2] :
      ( model(X3,X1)
      & ~ model(X3,X2)
      & ? [X4] : model(X4,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',non_thm_spt) ).

fof(nota,axiom,
    ! [X7,X8] :
      ( ? [X1,X2] :
          ( status(X1,X2,X7)
          & ~ status(X1,X2,X8) )
    <=> nota(X7,X8) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nota) ).

fof(nota_csa_thm,conjecture,
    nota(csa,thm),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota_csa_thm) ).

fof(c_0_8,plain,
    ! [X9,X10] :
      ~ ( model(X9,X10)
      <=> model(X9,not(X10)) ),
    inference(fof_simplification,[status(thm)],[completeness]) ).

fof(c_0_9,plain,
    ? [X10] :
    ! [X9] : ~ model(X9,X10),
    inference(fof_simplification,[status(thm)],[contradiction]) ).

fof(c_0_10,plain,
    ! [X167,X168,X170,X171,X172] :
      ( ( model(esk10_2(X167,X168),X167)
        | status(X167,X168,thm) )
      & ( ~ model(esk10_2(X167,X168),X168)
        | status(X167,X168,thm) )
      & ( ~ status(X170,X171,thm)
        | ~ model(X172,X170)
        | model(X172,X171) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[thm])])])])])]) ).

fof(c_0_11,plain,
    ! [X337,X338] :
      ( ( ~ model(X337,X338)
        | ~ model(X337,not(X338)) )
      & ( model(X337,X338)
        | model(X337,not(X338)) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).

fof(c_0_12,plain,
    ! [X347] : ~ model(X347,esk57_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).

cnf(c_0_13,plain,
    ( status(X1,X2,thm)
    | ~ model(esk10_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    ( model(X1,X2)
    | model(X1,not(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,plain,
    ~ model(X1,esk57_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,plain,
    ( status(X1,not(X2),thm)
    | model(esk10_2(X1,not(X2)),X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,plain,
    ( model(X3,X2)
    | ~ status(X1,X2,thm)
    | ~ model(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_18,plain,
    status(X1,not(esk57_0),thm),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

fof(c_0_19,plain,
    ! [X342] : model(X342,esk53_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[tautology])]) ).

fof(c_0_20,plain,
    ! [X273,X274,X275,X276,X277] :
      ( ( ~ model(X275,X273)
        | ~ model(X275,not(X274))
        | status(X273,X274,csa) )
      & ( model(esk38_2(X276,X277),X276)
        | ~ status(X276,X277,csa) )
      & ( model(esk38_2(X276,X277),not(X277))
        | ~ status(X276,X277,csa) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[csa])])])])])]) ).

cnf(c_0_21,plain,
    ( model(X1,not(esk57_0))
    | ~ model(X1,X2) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    model(X1,esk53_0),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

fof(c_0_23,plain,
    ? [X3,X1,X2] :
      ( model(X3,X1)
      & ~ model(X3,X2)
      & ? [X4] : model(X4,X2) ),
    inference(fof_simplification,[status(thm)],[non_thm_spt]) ).

fof(c_0_24,plain,
    ! [X7,X8] :
      ( ? [X1,X2] :
          ( status(X1,X2,X7)
          & ~ status(X1,X2,X8) )
    <=> nota(X7,X8) ),
    inference(fof_simplification,[status(thm)],[nota]) ).

cnf(c_0_25,plain,
    ( status(X2,X3,csa)
    | ~ model(X1,X2)
    | ~ model(X1,not(X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_26,plain,
    model(X1,not(esk57_0)),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

fof(c_0_27,plain,
    ( model(esk67_0,esk68_0)
    & ~ model(esk67_0,esk69_0)
    & model(esk70_0,esk69_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_23])]) ).

fof(c_0_28,plain,
    ! [X311,X312,X313,X314,X315,X316] :
      ( ( ~ status(X313,X314,X311)
        | status(X313,X314,X312)
        | nota(X311,X312) )
      & ( status(esk47_2(X315,X316),esk48_2(X315,X316),X315)
        | ~ nota(X315,X316) )
      & ( ~ status(esk47_2(X315,X316),esk48_2(X315,X316),X316)
        | ~ nota(X315,X316) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])])]) ).

cnf(c_0_29,plain,
    ( status(X1,esk57_0,csa)
    | ~ model(X2,X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    model(esk70_0,esk69_0),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

fof(c_0_31,negated_conjecture,
    ~ nota(csa,thm),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nota_csa_thm])]) ).

cnf(c_0_32,plain,
    ( status(X1,X2,X4)
    | nota(X3,X4)
    | ~ status(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_33,plain,
    status(esk69_0,esk57_0,csa),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_34,negated_conjecture,
    ~ nota(csa,thm),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_35,plain,
    ( nota(csa,X1)
    | status(esk69_0,esk57_0,X1) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    status(esk69_0,esk57_0,thm),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_37,negated_conjecture,
    ~ model(X1,esk69_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_36]),c_0_15]) ).

cnf(c_0_38,plain,
    $false,
    inference(sr,[status(thm)],[c_0_30,c_0_37]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : KRS215+1 : TPTP v9.2.1. Bugfixed v5.4.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.13/0.32  % Computer : n013.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit   : 300
% 0.13/0.32  % WCLimit    : 300
% 0.13/0.32  % DateTime   : Mon May  4 20:40:56 EDT 2026
% 0.13/0.33  % CPUTime    : 
% 0.13/0.34  % start to proof: theBenchmark
% 1.34/1.74  % Version  : CSE_E---1.7
% 1.34/1.74  % Problem  : theBenchmark.p
% 1.34/1.74  % SZS status Theorem for theBenchmark.p
% 1.34/1.74  % SZS output start CNFRefutation
% See solution above
% 1.34/1.74  % Total time : 1.372s
%------------------------------------------------------------------------------