↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : LCL982+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 : n010.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:55:47 AM UTC 2026

% Result   : Theorem 4.93s 1.63s
% Output   : CNFRefutation 4.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   7 unt;   0 def)
%            Number of atoms       :   27 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  14   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    7 (   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   :   51 (  10 sgn  13   !;   0   ?)

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

fof(a5,axiom,
    ! [X0,X1,X2,X3,X4] : 'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(implies(X2,implies(X3,X4)),implies(X1,implies(not(X3),not(X0)))),implies(X0,X3)))) ).

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

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1,X2] : 'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    inference(negate_conjecture,[status(cth)],[prove_cn_1]) ).

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(implies(X2,implies(X3,X4)),implies(X1,implies(not(X3),not(X0)))),implies(X0,X3)))),
    inference(clausification,[status(esa)],[a5]) ).

cnf(c2,plain,
    ~ 'is$ua$utheorem'(implies(implies(sK7,sK8),implies(implies(sK8,sK9),implies(sK7,sK9)))),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

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

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

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

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

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

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

cnf(d6,plain,
    'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    inference(resolution,[status(thm)],[d5,c1]) ).

cnf(d7,plain,
    $false,
    inference(resolution,[status(thm)],[d6,c2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL982+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.10/0.36  % Computer : n010.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Fri Sep 25 23:55:31 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.93/1.63  % SZS status Theorem for theBenchmark.p
% 4.93/1.63  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------