↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 9.69s 1.71s
% Output   : CNFRefutation 9.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   19 (  10 unt;   0 nHn;  11 RR)
%            Number of literals    :   32 (   0 equ;  16 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    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn)

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

cnf(qyf,axiom,
    'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X2,X1))) ).

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

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

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

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

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

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

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

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

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

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

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

cnf(d8,plain,
    ( ~ 'is$ua$utheorem'(equivalent(X1,X0))
    | 'is$ua$utheorem'(equivalent(X0,X1)) ),
    inference(resolution,[status(thm)],[d4,d7]) ).

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

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

cnf(d11,plain,
    ~ 'is$ua$utheorem'(equivalent(equivalent(c,equivalent(c,a)),a)),
    inference(resolution,[status(thm)],[d10,c2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL120-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.08/0.34  % Computer : n007.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Fri Sep 25 21:51:09 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.69/1.71  % SZS status Unsatisfiable for theBenchmark.p
% 9.69/1.71  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------