↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SYN323+1 : TPTP v9.2.1. Released v2.0.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 : n012.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:36:47 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(church_46_4_2,conjecture,
    ? [X1] :
      ( ! [X2] :
          ( ( big_f(X2,X1)
           => big_f(X1,X2) )
         => big_g(X2,X1) )
     => ~ ! [X2] :
            ( ( big_f(X2,X1)
             => big_f(X1,X2) )
           => ~ big_g(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_4_2) ).

fof(c_0_1,negated_conjecture,
    ~ ? [X1] :
        ( ! [X2] :
            ( ( big_f(X2,X1)
             => big_f(X1,X2) )
           => big_g(X2,X1) )
       => ~ ! [X2] :
              ( ( big_f(X2,X1)
               => big_f(X1,X2) )
             => ~ big_g(X2,X1) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[church_46_4_2])]) ).

fof(c_0_2,negated_conjecture,
    ! [X6,X7,X8] :
      ( ( big_f(X7,X6)
        | big_g(X7,X6) )
      & ( ~ big_f(X6,X7)
        | big_g(X7,X6) )
      & ( big_f(X8,X6)
        | ~ big_g(X8,X6) )
      & ( ~ big_f(X6,X8)
        | ~ big_g(X8,X6) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( big_g(X2,X1)
    | ~ big_f(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( ~ big_f(X1,X2)
    | ~ big_g(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( big_f(X1,X2)
    | big_g(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ~ big_f(X1,X2),
    inference(csr,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( big_f(X1,X2)
    | ~ big_g(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    big_g(X1,X2),
    inference(sr,[status(thm)],[c_0_5,c_0_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : SYN323+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.06  % 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.08/0.24  % Computer : n012.cluster.edu
% 0.08/0.24  % Model    : x86_64 x86_64
% 0.08/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.24  % Memory   : 8042.1875MB
% 0.08/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.24  % CPULimit   : 300
% 0.08/0.24  % WCLimit    : 300
% 0.08/0.24  % DateTime   : Tue May  5 08:27:31 EDT 2026
% 0.08/0.24  % CPUTime    : 
% 0.08/0.25  % start to proof: theBenchmark
% 1.12/1.61  % Version  : CSE_E---1.7
% 1.12/1.61  % Problem  : theBenchmark.p
% 1.12/1.61  % SZS status Theorem for theBenchmark.p
% 1.12/1.61  % SZS output start CNFRefutation
% See solution above
% 1.12/1.61  % Total time : 1.361s
%------------------------------------------------------------------------------