↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 102.89s 30.56s
% Output   : CNFRefutation 102.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   30 (   8 unt;   0 nHn;  19 RR)
%            Number of literals    :   64 (   0 equ;  36 neg)
%            Maximal clause size   :    3 (   2 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   :   75 (   0 sgn)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(d18,plain,
    ( 'is$ua$utheorem'(equivalent(equivalent(X0,X1),X1))
    | ~ 'is$ua$utheorem'(X0) ),
    inference(resolution,[status(thm)],[d17,d11]) ).

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

cnf(d20,plain,
    ( ~ 'is$ua$utheorem'(X2)
    | ~ 'is$ua$utheorem'(equivalent(equivalent(X2,X0),X1))
    | 'is$ua$utheorem'(equivalent(X0,X1)) ),
    inference(resolution,[status(thm)],[d19,d18]) ).

cnf(d21,plain,
    ( 'is$ua$utheorem'(equivalent(equivalent(X1,X0),X2))
    | ~ 'is$ua$utheorem'(equivalent(X0,equivalent(X1,X2))) ),
    inference(resolution,[status(thm)],[d20,d12]) ).

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

cnf(d23,plain,
    $false,
    inference(resolution,[status(thm)],[d22,c2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL024-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45  % Computer : n007.cluster.edu
% 0.20/0.45  % Model    : x86_64 x86_64
% 0.20/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45  % Memory   : 8046.5625MB
% 0.20/0.45  % OS       : Linux 6.8.0-71-generic
% 0.20/0.45  % CPULimit : 300
% 0.20/0.45  % WCLimit  : 300
% 0.20/0.45  % DateTime : Fri Sep 25 21:42:24 UTC 2026
% 0.20/0.45  % CPUTime  : 
% 0.20/0.45  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 102.89/30.56  % SZS status Unsatisfiable for theBenchmark.p
% 102.89/30.56  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------