↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : LCL321-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n013.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:19 AM UTC 2026

% Result   : Unsatisfiable 11.99s 1.92s
% Output   : CNFRefutation 11.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   27 (  17 unt;   0 nHn;  12 RR)
%            Number of literals    :   39 (   2 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   48 (   7 sgn)

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

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

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

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

cnf(implies_definition,axiom,
    implies(X0,X1) = or(not(X0),X1) ).

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

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

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

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

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

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

cnf(c6,plain,
    implies(X0,X1) = or(not(X0),X1),
    inference(clausification,[status(esa)],[implies_definition]) ).

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

cnf(c8,plain,
    ( ~ theorem(X1)
    | ~ theorem(implies(X1,X0))
    | theorem(X0) ),
    inference(clausification,[status(esa)],[rule_2]) ).

cnf(d0,plain,
    theorem(implies(or(X0,X1),or(X1,X0))),
    inference(resolution,[status(thm)],[c3,c7]) ).

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

cnf(d2,plain,
    ( theorem(or(X1,not(X0)))
    | ~ theorem(implies(X0,X1)) ),
    inference(superposition,[status(thm)],[c6,d1]) ).

cnf(d3,plain,
    theorem(implies(X0,or(X1,X0))),
    inference(resolution,[status(thm)],[c2,c7]) ).

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

cnf(d5,plain,
    theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    inference(resolution,[status(thm)],[c4,c7]) ).

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

cnf(d7,plain,
    ( ~ theorem(or(X0,X2))
    | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[status(thm)],[d6,d4]) ).

cnf(d8,plain,
    ( ~ theorem(or(X2,X1))
    | theorem(or(X2,implies(X0,X1))) ),
    inference(superposition,[status(thm)],[c6,d7]) ).

cnf(d9,plain,
    ~ theorem(or(implies(p,q),not(q))),
    inference(resolution,[status(thm)],[d8,c0]) ).

cnf(d10,plain,
    ~ theorem(implies(q,implies(p,q))),
    inference(resolution,[status(thm)],[d9,d2]) ).

cnf(d11,plain,
    theorem(implies(X1,implies(X0,X1))),
    inference(superposition,[status(thm)],[c6,d3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL321-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n013.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % 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 22:14:51 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.99/1.92  % SZS status Unsatisfiable for theBenchmark.p
% 11.99/1.92  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------