↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : LCL169-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 : n006.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 9.13s 11.90s
% Output   : CNFRefutation 9.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (   9 unt;   0 nHn;   5 RR)
%            Number of literals    :   13 (   2 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn)

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

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

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

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

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

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

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(d0,plain,
    theorem(implies(or(X0,X0),X0)),
    inference(resolution,[status(thm)],[c1,c7]) ).

cnf(d1,plain,
    theorem(implies(implies(X0,not(X0)),not(X0))),
    inference(superposition,[status(thm)],[c6,d0]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL169-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/10.64  % Computer : n006.cluster.edu
% 0.16/10.64  % Model    : x86_64 x86_64
% 0.16/10.64  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/10.64  % Memory   : 8046.5625MB
% 0.16/10.64  % OS       : Linux 6.8.0-71-generic
% 0.16/10.64  % CPULimit : 300
% 0.16/10.64  % WCLimit  : 300
% 0.16/10.64  % DateTime : Fri Sep 25 21:57:08 UTC 2026
% 0.16/10.64  % CPUTime  : 
% 0.16/10.64  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.13/11.90  % SZS status Unsatisfiable for theBenchmark.p
% 9.13/11.90  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------