↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LCL684+1.001 : TPTP v9.2.1. Released v4.0.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 : n011.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:44:48 PM UTC 2026

% Result   : Theorem 0.23s 1.61s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   6 unt;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   51 (  27   ~;  16   |;   7   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   22 (   0 sgn  14   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(main,conjecture,
    ~ ? [X1] :
        ~ ( ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ! [X1] :
                    ( ~ r1(X2,X1)
                    | ~ ( p201(X1)
                        & p101(X1) ) ) )
          | ~ ( p201(X1)
              & p101(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).

fof(transitivity,axiom,
    ! [X1,X2,X3] :
      ( ( r1(X1,X2)
        & r1(X2,X3) )
     => r1(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).

fof(reflexivity,axiom,
    ! [X1] : r1(X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).

fof(i_0_3,negated_conjecture,
    ~ ~ ? [X1] :
          ~ ( ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ! [X1] :
                      ( ~ r1(X2,X1)
                      | ~ ( p201(X1)
                          & p101(X1) ) ) )
            | ~ ( p201(X1)
                & p101(X1) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).

fof(i_0_4,plain,
    ! [X12,X13,X14] :
      ( ~ r1(X12,X13)
      | ~ r1(X13,X14)
      | r1(X12,X14) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])]) ).

fof(i_0_5,negated_conjecture,
    ! [X16,X17] :
      ( ( ~ r1(esk1_0,X16)
        | ~ r1(X16,X17)
        | ~ p201(X17)
        | ~ p101(X17) )
      & p201(esk1_0)
      & p101(esk1_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_3])])])]) ).

fof(i_0_6,plain,
    ! [X11] : r1(X11,X11),
    inference(variable_rename,[status(thm)],[reflexivity]) ).

cnf(i_0_7,plain,
    ( r1(X1,X3)
    | ~ r1(X1,X2)
    | ~ r1(X2,X3) ),
    inference(split_conjunct,[status(thm)],[i_0_4]),
    [final] ).

cnf(i_0_8,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ r1(X1,X2)
    | ~ p201(X2)
    | ~ p101(X2) ),
    inference(split_conjunct,[status(thm)],[i_0_5]),
    [final] ).

cnf(i_0_9,plain,
    r1(X1,X1),
    inference(split_conjunct,[status(thm)],[i_0_6]),
    [final] ).

cnf(i_0_10,negated_conjecture,
    p101(esk1_0),
    inference(split_conjunct,[status(thm)],[i_0_5]),
    [final] ).

cnf(i_0_11,negated_conjecture,
    p201(esk1_0),
    inference(split_conjunct,[status(thm)],[i_0_5]),
    [final] ).

cnf(i_0_12,plain,
    $false,
    inference(scs_inference,[],[i_0_9,i_0_11,i_0_10,i_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL684+1.001 : TPTP v9.2.1. Released v4.0.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.15/0.32  % Computer : n011.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Mon May  4 22:59:17 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 0.23/1.61  % Version  : CSE_E---1.7
% 0.23/1.61  % Problem  : theBenchmark.p
% 0.23/1.61  % SZS status Theorem for theBenchmark.p
% 0.23/1.61  % SZS output start CNFRefutation
% See solution above
% 0.23/1.62  % Total time : 1.270s
%------------------------------------------------------------------------------