↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 11.20s 11.90s
% Output   : CNFRefutation 11.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   27 (  12 unt;   0 nHn;  14 RR)
%            Number of literals    :   47 (   0 equ;  23 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   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   :   70 (   0 sgn)

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

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

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

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

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

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

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

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

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

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

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

cnf(d7,plain,
    ~ 'is$ua$utheorem'(equivalent(a,equivalent(equivalent(a,b),b))),
    inference(resolution,[status(thm)],[d6,c2]) ).

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

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

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

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

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

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

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

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

cnf(d16,plain,
    'is$ua$utheorem'(equivalent(equivalent(X0,X0),equivalent(X1,X1))),
    inference(resolution,[status(thm)],[d14,d3]) ).

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

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

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

cnf(d20,plain,
    $false,
    inference(resolution,[status(thm)],[d19,d7]) ).

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