↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n019.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:45 AM UTC 2026

% Result   : Unsatisfiable 16.09s 2.81s
% Output   : CNFRefutation 16.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   14 (   8 unt;   0 nHn;   8 RR)
%            Number of literals    :   23 (   0 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   50 (   0 sgn)

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

cnf(lg_3,axiom,
    'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)) ).

cnf(prove_lg_4,negated_conjecture,
    ~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))) ).

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

cnf(c1,plain,
    'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
    inference(clausification,[status(esa)],[lg_3]) ).

cnf(c2,plain,
    ~ 'is$ua$utheorem'(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
    inference(clausification,[status(esa)],[prove_lg_4]) ).

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

cnf(d1,plain,
    'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
    inference(resolution,[status(thm)],[d0,c1]) ).

cnf(d2,plain,
    'is$ua$utheorem'(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),X0),equivalent(equivalent(X3,X4),X1)))),
    inference(resolution,[status(thm)],[d1,d0]) ).

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL098-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n019.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 21:51:04 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.09/2.81  % SZS status Unsatisfiable for theBenchmark.p
% 16.09/2.81  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------