↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SYN340+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n018.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 : Sun Sep 27 09:21:52 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(church_46_15_5,conjecture,
    ? [X0] :
    ! [X1] :
    ? [X2,X3] :
      ( 'big$uf'(X0,X1,X2,X3,X2)
     => 'big$uf'(X2,X0,X1,X2,X3) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ? [X0] :
      ! [X1] :
      ? [X2,X3] :
        ( 'big$uf'(X0,X1,X2,X3,X2)
       => 'big$uf'(X2,X0,X1,X2,X3) ),
    inference(negate_conjecture,[status(cth)],[church_46_15_5]) ).

cnf(c0,plain,
    'big$uf'(X0,sK1(X0),X1,X2,X1),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c1,plain,
    ~ 'big$uf'(X0,X1,sK1(X1),X0,X2),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    $false,
    inference(resolution,[status(thm)],[c1,c0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN340+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n018.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 26 17:38:21 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.19/1.53  % SZS status Theorem for theBenchmark.p
% 8.19/1.53  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------