↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n004.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 07:54:28 AM UTC 2026

% Result   : Theorem 74.97s 21.44s
% Output   : CNFRefutation 74.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (  11 unt;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   49 (  26   ~;  21   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   58 (   4 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(condensed_detachment,axiom,
    ! [X0,X1] :
      ( ( 'is$ua$utheorem'(X0)
        & 'is$ua$utheorem'(implies(X0,X1)) )
     => 'is$ua$utheorem'(X1) ) ).

fof(cn_1,axiom,
    ! [X0,X1,X2] : 'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ).

fof(cn_2,axiom,
    ! [X0] : 'is$ua$utheorem'(implies(implies(not(X0),X0),X0)) ).

fof(cn_3,axiom,
    ! [X0,X1] : 'is$ua$utheorem'(implies(X0,implies(not(X0),X1))) ).

fof(prove_cn_45,conjecture,
    'is$ua$utheorem'(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))) ).

fof(negated_conjecture,negated_conjecture,
    ~ 'is$ua$utheorem'(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
    inference(negate_conjecture,[status(cth)],[prove_cn_45]) ).

cnf(c0,plain,
    ( 'is$ua$utheorem'(X1)
    | ~ 'is$ua$utheorem'(X0)
    | ~ 'is$ua$utheorem'(implies(X0,X1)) ),
    inference(clausification,[status(esa)],[condensed_detachment]) ).

cnf(c1,plain,
    'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    inference(clausification,[status(esa)],[cn_1]) ).

cnf(c2,plain,
    'is$ua$utheorem'(implies(implies(not(X0),X0),X0)),
    inference(clausification,[status(esa)],[cn_2]) ).

cnf(c3,plain,
    'is$ua$utheorem'(implies(X0,implies(not(X0),X1))),
    inference(clausification,[status(esa)],[cn_3]) ).

cnf(c4,plain,
    ~ 'is$ua$utheorem'(implies(implies(x,implies(y,z)),implies(implies(not(z),y),implies(x,z)))),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ 'is$ua$utheorem'(X0)
    | 'is$ua$utheorem'(implies(not(X0),X1)) ),
    inference(resolution,[status(thm)],[c3,c0]) ).

cnf(d1,plain,
    ( ~ 'is$ua$utheorem'(implies(X2,X0))
    | 'is$ua$utheorem'(implies(implies(X0,X1),implies(X2,X1))) ),
    inference(resolution,[status(thm)],[c1,c0]) ).

cnf(d2,plain,
    ( ~ 'is$ua$utheorem'(implies(X1,X2))
    | 'is$ua$utheorem'(implies(X0,X2))
    | ~ 'is$ua$utheorem'(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[d1,c0]) ).

cnf(d3,plain,
    ( 'is$ua$utheorem'(implies(X0,X2))
    | ~ 'is$ua$utheorem'(implies(implies(not(X0),X1),X2)) ),
    inference(resolution,[status(thm)],[d2,c3]) ).

cnf(d4,plain,
    ( ~ 'is$ua$utheorem'(implies(X0,X3))
    | 'is$ua$utheorem'(implies(implies(X3,X1),X2))
    | ~ 'is$ua$utheorem'(implies(implies(X0,X1),X2)) ),
    inference(resolution,[status(thm)],[d2,d1]) ).

cnf(d5,plain,
    ( 'is$ua$utheorem'(implies(implies(X1,X0),X0))
    | ~ 'is$ua$utheorem'(implies(not(X0),X1)) ),
    inference(resolution,[status(thm)],[d4,c2]) ).

cnf(d6,plain,
    ( 'is$ua$utheorem'(implies(X1,X0))
    | ~ 'is$ua$utheorem'(implies(not(X0),not(X1))) ),
    inference(resolution,[status(thm)],[d5,d3]) ).

cnf(d7,plain,
    ( ~ 'is$ua$utheorem'(X1)
    | 'is$ua$utheorem'(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[d6,d0]) ).

cnf(d8,plain,
    ( 'is$ua$utheorem'(implies(implies(X2,X0),X3))
    | ~ 'is$ua$utheorem'(implies(implies(implies(X0,X1),implies(X2,X1)),X3)) ),
    inference(resolution,[status(thm)],[d2,c1]) ).

cnf(d9,plain,
    ( ~ 'is$ua$utheorem'(implies(not(implies(X0,X2)),implies(X1,X2)))
    | 'is$ua$utheorem'(implies(implies(X0,X1),implies(X0,X2))) ),
    inference(resolution,[status(thm)],[d8,d5]) ).

cnf(d10,plain,
    ( ~ 'is$ua$utheorem'(implies(X1,X2))
    | 'is$ua$utheorem'(implies(implies(X0,X1),implies(X0,X2))) ),
    inference(resolution,[status(thm)],[d9,d7]) ).

cnf(d11,plain,
    ( ~ 'is$ua$utheorem'(implies(X3,X0))
    | 'is$ua$utheorem'(implies(implies(X1,X2),implies(X3,X2)))
    | ~ 'is$ua$utheorem'(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[d4,d1]) ).

cnf(d12,plain,
    ( 'is$ua$utheorem'(implies(implies(X4,X2),implies(X0,implies(X4,X3))))
    | ~ 'is$ua$utheorem'(implies(X1,implies(X2,X3)))
    | ~ 'is$ua$utheorem'(implies(X0,X1)) ),
    inference(resolution,[status(thm)],[d11,d8]) ).

cnf(d13,plain,
    ( ~ 'is$ua$utheorem'(implies(implies(not(z),y),X0))
    | ~ 'is$ua$utheorem'(implies(X0,implies(implies(y,z),z))) ),
    inference(resolution,[status(thm)],[d12,c4]) ).

cnf(d14,plain,
    ( ~ 'is$ua$utheorem'(implies(X0,z))
    | ~ 'is$ua$utheorem'(implies(implies(not(z),y),implies(implies(y,z),X0))) ),
    inference(resolution,[status(thm)],[d13,d10]) ).

cnf(d15,plain,
    ~ 'is$ua$utheorem'(implies(implies(not(z),z),z)),
    inference(resolution,[status(thm)],[d14,c1]) ).

cnf(d16,plain,
    $false,
    inference(resolution,[status(thm)],[c2,d15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL384+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/10.40  % Computer : n004.cluster.edu
% 0.12/10.40  % Model    : x86_64 x86_64
% 0.12/10.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.40  % Memory   : 8046.5625MB
% 0.12/10.40  % OS       : Linux 6.8.0-71-generic
% 0.12/10.40  % CPULimit : 300
% 0.12/10.40  % WCLimit  : 300
% 0.12/10.40  % DateTime : Fri Sep 25 22:23:17 UTC 2026
% 0.12/10.40  % CPUTime  : 
% 0.12/10.40  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 74.97/21.44  % SZS status Theorem for theBenchmark.p
% 74.97/21.44  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------