↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n016.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:22 AM UTC 2026

% Result   : Unsatisfiable 10.07s 2.78s
% Output   : CNFRefutation 10.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   11 (   6 unt;   0 nHn;   7 RR)
%            Number of literals    :   19 (   0 equ;  10 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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   24 (   0 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(prove_cn_06,negated_conjecture,
    ~ 'is$ua$utheorem'(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))) ).

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(c4,plain,
    ~ 'is$ua$utheorem'(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))),
    inference(clausification,[status(esa)],[prove_cn_06]) ).

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

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

cnf(d4,plain,
    $false,
    inference(resolution,[status(thm)],[d3,c4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL357-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.36  % Computer : n016.cluster.edu
% 0.07/0.36  % Model    : x86_64 x86_64
% 0.07/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.36  % Memory   : 8046.5625MB
% 0.07/0.36  % OS       : Linux 6.8.0-71-generic
% 0.07/0.36  % CPULimit : 300
% 0.07/0.36  % WCLimit  : 300
% 0.07/0.36  % DateTime : Fri Sep 25 22:24:14 UTC 2026
% 0.02/0.36  % CPUTime  : 
% 0.02/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.07/2.78  % SZS status Unsatisfiable for theBenchmark.p
% 10.07/2.78  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------