↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : LCL082-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 : n009.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:42 AM UTC 2026

% Result   : Unsatisfiable 12.95s 2.38s
% Output   : CNFRefutation 12.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   19 (  12 unt;   0 nHn;   5 RR)
%            Number of literals    :   28 (   0 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   57 (  29 sgn)

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

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

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

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

cnf(c2,plain,
    ~ 'is$ua$utheorem'(implies(a,implies(b,a))),
    inference(clausification,[status(esa)],[prove_ic_2]) ).

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

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

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

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

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

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

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

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

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

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

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

cnf(d11,plain,
    'is$ua$utheorem'(implies(X0,implies(X1,X0))),
    inference(resolution,[status(thm)],[d10,d4]) ).

cnf(d12,plain,
    $false,
    inference(resolution,[status(thm)],[d11,c2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL082-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  % Computer : n009.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Fri Sep 25 21:50:00 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.95/2.38  % SZS status Unsatisfiable for theBenchmark.p
% 12.95/2.38  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------