↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : LCL223-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/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:54:07 AM UTC 2026

% Result   : Unsatisfiable 39.07s 5.61s
% Output   : CNFRefutation 39.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   44 (  22 unt;   0 nHn;  18 RR)
%            Number of literals    :   70 (   0 equ;  29 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :  105 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
    ~ theorem(or(not(or(p,q)),or(not(or(p,or(not(q),r))),or(p,r)))) ).

cnf(axiom_1_2,axiom,
    axiom(or(not(or(X0,X0)),X0)) ).

cnf(axiom_1_3,axiom,
    axiom(or(not(X0),or(X1,X0))) ).

cnf(axiom_1_4,axiom,
    axiom(or(not(or(X0,X1)),or(X1,X0))) ).

cnf(axiom_1_5,axiom,
    axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) ).

cnf(axiom_1_6,axiom,
    axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) ).

cnf(rule_1,axiom,
    ( ~ axiom(X0)
    | theorem(X0) ) ).

cnf(rule_2,axiom,
    ( ~ theorem(X1)
    | ~ axiom(or(not(X1),X0))
    | theorem(X0) ) ).

cnf(rule_3,axiom,
    ( ~ theorem(or(not(X2),X1))
    | ~ axiom(or(not(X0),X2))
    | theorem(or(not(X0),X1)) ) ).

cnf(c0,plain,
    ~ theorem(or(not(or(p,q)),or(not(or(p,or(not(q),r))),or(p,r)))),
    inference(clausification,[status(esa)],[prove_this]) ).

cnf(c1,plain,
    axiom(or(not(or(X0,X0)),X0)),
    inference(clausification,[status(esa)],[axiom_1_2]) ).

cnf(c2,plain,
    axiom(or(not(X0),or(X1,X0))),
    inference(clausification,[status(esa)],[axiom_1_3]) ).

cnf(c3,plain,
    axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(clausification,[status(esa)],[axiom_1_4]) ).

cnf(c4,plain,
    axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(clausification,[status(esa)],[axiom_1_5]) ).

cnf(c5,plain,
    axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(clausification,[status(esa)],[axiom_1_6]) ).

cnf(c6,plain,
    ( ~ axiom(X0)
    | theorem(X0) ),
    inference(clausification,[status(esa)],[rule_1]) ).

cnf(c7,plain,
    ( ~ theorem(X1)
    | ~ axiom(or(not(X1),X0))
    | theorem(X0) ),
    inference(clausification,[status(esa)],[rule_2]) ).

cnf(c8,plain,
    ( ~ theorem(or(not(X2),X1))
    | ~ axiom(or(not(X0),X2))
    | theorem(or(not(X0),X1)) ),
    inference(clausification,[status(esa)],[rule_3]) ).

cnf(d0,plain,
    ( ~ theorem(or(X1,or(X0,X2)))
    | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[status(thm)],[c7,c4]) ).

cnf(d1,plain,
    ( theorem(or(not(or(X1,or(X0,X2))),X3))
    | ~ theorem(or(not(or(X0,or(X1,X2))),X3)) ),
    inference(resolution,[status(thm)],[c8,c4]) ).

cnf(d2,plain,
    ( ~ theorem(or(not(X1),X2))
    | theorem(or(not(or(X0,X1)),or(X0,X2))) ),
    inference(resolution,[status(thm)],[c5,c7]) ).

cnf(d3,plain,
    ( theorem(or(not(or(not(X1),X2)),X3))
    | ~ theorem(or(not(or(not(or(X0,X1)),or(X0,X2))),X3)) ),
    inference(resolution,[status(thm)],[c8,c5]) ).

cnf(d4,plain,
    ( ~ theorem(or(not(or(X2,X1)),X3))
    | theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),X3))) ),
    inference(resolution,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    ( theorem(or(not(or(X1,or(not(X4),X2))),or(not(or(X0,X4)),X3)))
    | ~ theorem(or(not(or(X0,or(X1,X2))),X3)) ),
    inference(resolution,[status(thm)],[d4,d1]) ).

cnf(d6,plain,
    ( theorem(or(not(or(X0,X4)),or(not(or(X1,or(not(X4),X2))),X3)))
    | ~ theorem(or(not(or(X0,or(X1,X2))),X3)) ),
    inference(resolution,[status(thm)],[d5,d0]) ).

cnf(d7,plain,
    ~ theorem(or(not(or(p,or(p,r))),or(p,r))),
    inference(resolution,[status(thm)],[d6,c0]) ).

cnf(d8,plain,
    ( ~ theorem(or(X0,X0))
    | theorem(X0) ),
    inference(resolution,[status(thm)],[c7,c1]) ).

cnf(d9,plain,
    ( ~ theorem(X1)
    | theorem(or(X0,X1)) ),
    inference(resolution,[status(thm)],[c7,c2]) ).

cnf(d10,plain,
    ( ~ theorem(or(X0,X2))
    | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[status(thm)],[d0,d9]) ).

cnf(d11,plain,
    ( theorem(or(X0,X1))
    | ~ theorem(or(or(X0,X1),X1)) ),
    inference(resolution,[status(thm)],[d10,d8]) ).

cnf(d12,plain,
    ( ~ theorem(or(X1,X0))
    | theorem(or(X0,X1)) ),
    inference(resolution,[status(thm)],[c7,c3]) ).

cnf(d13,plain,
    ( theorem(or(not(or(X1,X0)),X2))
    | ~ theorem(or(not(or(X0,X1)),X2)) ),
    inference(resolution,[status(thm)],[c8,c3]) ).

cnf(d14,plain,
    theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[status(thm)],[c1,c6]) ).

cnf(d15,plain,
    theorem(or(not(or(X0,or(or(X0,X1),X1))),or(X0,X1))),
    inference(resolution,[status(thm)],[d1,d14]) ).

cnf(d16,plain,
    theorem(or(not(or(or(or(X0,X1),X1),X0)),or(X0,X1))),
    inference(resolution,[status(thm)],[d15,d13]) ).

cnf(d17,plain,
    ( theorem(or(not(X1),X2))
    | ~ theorem(or(not(or(X0,X1)),X2)) ),
    inference(resolution,[status(thm)],[c8,c2]) ).

cnf(d18,plain,
    ( ~ theorem(or(not(or(X0,X2)),X3))
    | theorem(or(not(or(X0,or(X1,X2))),or(X1,X3))) ),
    inference(resolution,[status(thm)],[d1,d2]) ).

cnf(d19,plain,
    ( theorem(or(not(or(X3,X1)),or(X3,X2)))
    | ~ theorem(or(not(or(X0,X1)),X2)) ),
    inference(resolution,[status(thm)],[d18,d17]) ).

cnf(d20,plain,
    theorem(or(not(or(X0,X1)),or(X0,or(X1,X2)))),
    inference(resolution,[status(thm)],[d19,d16]) ).

cnf(d21,plain,
    theorem(or(not(or(X0,X1)),or(X1,or(X0,X2)))),
    inference(resolution,[status(thm)],[d20,d13]) ).

cnf(d22,plain,
    theorem(or(X0,or(not(or(X1,X0)),or(X1,X2)))),
    inference(resolution,[status(thm)],[d21,d0]) ).

cnf(d23,plain,
    theorem(or(or(not(or(X0,X1)),or(X0,X2)),X1)),
    inference(resolution,[status(thm)],[d22,d12]) ).

cnf(d24,plain,
    theorem(or(not(or(X0,or(X0,X1))),or(X0,X1))),
    inference(resolution,[status(thm)],[d23,d11]) ).

cnf(d25,plain,
    $false,
    inference(resolution,[status(thm)],[d24,d7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL223-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n007.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Fri Sep 25 22:01:10 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 39.07/5.61  % SZS status Unsatisfiable for theBenchmark.p
% 39.07/5.61  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------