↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 22.79s 11.37s
% Output   : CNFRefutation 22.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   29
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   57 (  10 unt;   0 nHn;  39 RR)
%            Number of literals    :  141 (   0 equ;  86 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    6 (   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   :  159 (   0 sgn)

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

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

cnf(prove_yro,negated_conjecture,
    ~ 'is$ua$utheorem'(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(c,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,X2),equivalent(equivalent(X0,X2),X1)))),
    inference(clausification,[status(esa)],[xhk]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(d34,plain,
    'is$ua$utheorem'(equivalent(X0,X0)),
    inference(resolution,[status(thm)],[d33,d12]) ).

cnf(d35,plain,
    'is$ua$utheorem'(equivalent(equivalent(equivalent(X0,X1),X1),X0)),
    inference(resolution,[status(thm)],[d34,d28]) ).

cnf(d36,plain,
    ( ~ 'is$ua$utheorem'(equivalent(X1,X0))
    | 'is$ua$utheorem'(equivalent(X0,X1)) ),
    inference(resolution,[status(thm)],[d35,d25]) ).

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

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

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

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

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

cnf(d42,plain,
    ( ~ 'is$ua$utheorem'(equivalent(X1,X0))
    | ~ 'is$ua$utheorem'(equivalent(equivalent(X1,X2),X2))
    | 'is$ua$utheorem'(X0) ),
    inference(resolution,[status(thm)],[d28,d41]) ).

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

cnf(d44,plain,
    ( 'is$ua$utheorem'(equivalent(equivalent(equivalent(X1,X1),equivalent(X0,X2)),X2))
    | ~ 'is$ua$utheorem'(X0) ),
    inference(resolution,[status(thm)],[d33,d43]) ).

cnf(d45,plain,
    ( 'is$ua$utheorem'(equivalent(X2,equivalent(X2,X1)))
    | ~ 'is$ua$utheorem'(equivalent(equivalent(X0,X0),X1)) ),
    inference(resolution,[status(thm)],[d33,d38]) ).

cnf(d46,plain,
    ( ~ 'is$ua$utheorem'(X1)
    | 'is$ua$utheorem'(equivalent(X0,equivalent(X0,X1))) ),
    inference(resolution,[status(thm)],[d45,d44]) ).

cnf(d47,plain,
    ( 'is$ua$utheorem'(equivalent(X1,X2))
    | ~ 'is$ua$utheorem'(equivalent(X1,equivalent(X2,X0)))
    | ~ 'is$ua$utheorem'(X0) ),
    inference(resolution,[status(thm)],[d46,d40]) ).

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

cnf(d49,plain,
    'is$ua$utheorem'(equivalent(equivalent(X0,X1),equivalent(X2,equivalent(equivalent(X2,X1),X0)))),
    inference(resolution,[status(thm)],[d48,d37]) ).

cnf(d50,plain,
    $false,
    inference(resolution,[status(thm)],[d49,c2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL167-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.09/0.37  % Computer : n009.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Fri Sep 25 21:56:29 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 22.79/11.37  % SZS status Unsatisfiable for theBenchmark.p
% 22.79/11.37  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------