↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 9.68s 11.63s
% Output   : CNFRefutation 9.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    8 (   6 unt;   0 nHn;   5 RR)
%            Number of literals    :   10 (   0 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    6 (   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   :   11 (   0 sgn)

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

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

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

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

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

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

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

cnf(d1,plain,
    $false,
    inference(resolution,[status(thm)],[d0,c0]) ).

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