↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : LCL048-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/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:53:37 AM UTC 2026

% Result   : Unsatisfiable 36.26s 11.49s
% Output   : CNFRefutation 36.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   32 (  13 unt;   0 nHn;  17 RR)
%            Number of literals    :   56 (   0 equ;  30 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    9 (   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   :   75 (  15 sgn)

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

cnf(cn_1,axiom,
    'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ).

cnf(cn_2,axiom,
    'is$ua$utheorem'(implies(implies(not(X0),X0),X0)) ).

cnf(cn_3,axiom,
    'is$ua$utheorem'(implies(X0,implies(not(X0),X1))) ).

cnf(prove_cn_19,negated_conjecture,
    ~ 'is$ua$utheorem'(implies(implies(implies(a,b),c),implies(b,c))) ).

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(implies(a,b),c),implies(b,c))),
    inference(clausification,[status(esa)],[prove_cn_19]) ).

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

cnf(d1,plain,
    ( ~ 'is$ua$utheorem'(implies(X1,X2))
    | '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(X0,X2))
    | ~ 'is$ua$utheorem'(implies(implies(not(X0),X1),X2)) ),
    inference(resolution,[status(thm)],[d1,c3]) ).

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

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

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

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

cnf(d7,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)],[d1,d0]) ).

cnf(d8,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)],[d7,d0]) ).

cnf(d9,plain,
    ( ~ 'is$ua$utheorem'(implies(X0,implies(a,b)))
    | ~ 'is$ua$utheorem'(implies(b,X0)) ),
    inference(resolution,[status(thm)],[d8,c4]) ).

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

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

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

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

cnf(d14,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)],[d1,c1]) ).

cnf(d15,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)],[d14,d11]) ).

cnf(d16,plain,
    ( ~ 'is$ua$utheorem'(implies(X1,X2))
    | 'is$ua$utheorem'(implies(implies(X0,X1),implies(X0,X2))) ),
    inference(resolution,[status(thm)],[d15,d13]) ).

cnf(d17,plain,
    ( ~ 'is$ua$utheorem'(implies(b,implies(a,X0)))
    | ~ 'is$ua$utheorem'(implies(X0,b)) ),
    inference(resolution,[status(thm)],[d16,d9]) ).

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

cnf(d19,plain,
    ( ~ 'is$ua$utheorem'(implies(implies(not(b),X1),b))
    | ~ 'is$ua$utheorem'(implies(a,implies(X0,X1))) ),
    inference(resolution,[status(thm)],[d18,d17]) ).

cnf(d20,plain,
    ~ 'is$ua$utheorem'(implies(a,implies(X0,b))),
    inference(resolution,[status(thm)],[d19,c2]) ).

cnf(d21,plain,
    $false,
    inference(resolution,[status(thm)],[d20,d6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL048-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/5.39  % Computer : n004.cluster.edu
% 0.11/5.39  % Model    : x86_64 x86_64
% 0.11/5.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39  % Memory   : 8046.5625MB
% 0.11/5.39  % OS       : Linux 6.8.0-71-generic
% 0.11/5.39  % CPULimit : 300
% 0.11/5.39  % WCLimit  : 300
% 0.11/5.39  % DateTime : Fri Sep 25 21:46:11 UTC 2026
% 0.15/5.40  % CPUTime  : 
% 0.15/5.40  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 36.26/11.49  % SZS status Unsatisfiable for theBenchmark.p
% 36.26/11.49  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------