↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n016.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 09:15:43 AM UTC 2026

% Result   : Unsatisfiable 8.75s 1.60s
% Output   : CNFRefutation 8.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   15 (  15 unt;   0 nHn;  11 RR)
%            Number of literals    :   15 (  14 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :    6 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_006,axiom,
    f(nil) = btrue ).

cnf(axiom_008,axiom,
    prop1(X0) = eq(f(X0),bfalse) ).

cnf(axiom_010,axiom,
    eq(btrue,bfalse) = bfalse ).

cnf(axiom_011,axiom,
    eq(X0,X0) = btrue ).

cnf(goal,negated_conjecture,
    eq(prop1(X0),bfalse) != btrue ).

cnf(c6,plain,
    f(nil) = btrue,
    inference(clausification,[status(esa)],[axiom_006]) ).

cnf(c8,plain,
    prop1(X0) = eq(f(X0),bfalse),
    inference(clausification,[status(esa)],[axiom_008]) ).

cnf(c10,plain,
    eq(btrue,bfalse) = bfalse,
    inference(clausification,[status(esa)],[axiom_010]) ).

cnf(c11,plain,
    eq(X0,X0) = btrue,
    inference(clausification,[status(esa)],[axiom_011]) ).

cnf(c12,plain,
    eq(prop1(X0),bfalse) != btrue,
    inference(clausification,[status(esa)],[goal]) ).

cnf(d0,plain,
    prop1(nil) = eq(btrue,bfalse),
    inference(superposition,[status(thm)],[c6,c8]) ).

cnf(d1,plain,
    prop1(nil) = bfalse,
    inference(demodulation,[status(thm)],[d0,c10]) ).

cnf(d2,plain,
    eq(bfalse,bfalse) != btrue,
    inference(superposition,[status(thm)],[d1,c12]) ).

cnf(d3,plain,
    btrue != btrue,
    inference(demodulation,[status(thm)],[d2,c11]) ).

cnf(d4,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX233-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n016.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.38  % DateTime : Sat Sep 26 17:05:45 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.75/1.60  % SZS status Unsatisfiable for theBenchmark.p
% 8.75/1.60  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------