↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : FLD060-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/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:10:57 AM UTC 2026

% Result   : Unsatisfiable 42.27s 19.12s
% Output   : CNFRefutation 42.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   24 (  10 unt;   0 nHn;  24 RR)
%            Number of literals    :   59 (   0 equ;  40 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(a_is_defined,hypothesis,
    defined(a) ).

cnf(b_is_defined,hypothesis,
    defined(b) ).

cnf(less_or_equal_3,negated_conjecture,
    'less$uor$uequal'(a,b) ).

cnf(not_less_or_equal_4,negated_conjecture,
    ~ 'less$uor$uequal'(add(a,a),add(b,b)) ).

cnf(commutativity_addition,axiom,
    ( ~ defined(X1)
    | ~ defined(X0)
    | equalish(add(X0,X1),add(X1,X0)) ) ).

cnf(transitivity_of_order_relation,axiom,
    ( ~ 'less$uor$uequal'(X2,X1)
    | ~ 'less$uor$uequal'(X0,X2)
    | 'less$uor$uequal'(X0,X1) ) ).

cnf(compatibility_of_order_relation_and_addition,axiom,
    ( ~ 'less$uor$uequal'(X0,X2)
    | ~ defined(X1)
    | 'less$uor$uequal'(add(X0,X1),add(X2,X1)) ) ).

cnf(compatibility_of_equality_and_order_relation,axiom,
    ( ~ equalish(X2,X0)
    | ~ 'less$uor$uequal'(X2,X1)
    | 'less$uor$uequal'(X0,X1) ) ).

cnf(c0,plain,
    defined(a),
    inference(clausification,[status(esa)],[a_is_defined]) ).

cnf(c1,plain,
    defined(b),
    inference(clausification,[status(esa)],[b_is_defined]) ).

cnf(c2,plain,
    'less$uor$uequal'(a,b),
    inference(clausification,[status(esa)],[less_or_equal_3]) ).

cnf(c3,plain,
    ~ 'less$uor$uequal'(add(a,a),add(b,b)),
    inference(clausification,[status(esa)],[not_less_or_equal_4]) ).

cnf(c7,plain,
    ( ~ defined(X1)
    | equalish(add(X0,X1),add(X1,X0))
    | ~ defined(X0) ),
    inference(clausification,[status(esa)],[commutativity_addition]) ).

cnf(c20,plain,
    ( ~ 'less$uor$uequal'(X1,X2)
    | 'less$uor$uequal'(X0,X2)
    | ~ 'less$uor$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[transitivity_of_order_relation]) ).

cnf(c22,plain,
    ( ~ 'less$uor$uequal'(X1,X2)
    | 'less$uor$uequal'(add(X1,X0),add(X2,X0))
    | ~ defined(X0) ),
    inference(clausification,[status(esa)],[compatibility_of_order_relation_and_addition]) ).

cnf(c29,plain,
    ( ~ equalish(X0,X2)
    | 'less$uor$uequal'(X2,X1)
    | ~ 'less$uor$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[compatibility_of_equality_and_order_relation]) ).

cnf(d0,plain,
    ( 'less$uor$uequal'(add(X1,X0),X3)
    | ~ 'less$uor$uequal'(add(X2,X0),X3)
    | ~ 'less$uor$uequal'(X1,X2)
    | ~ defined(X0) ),
    inference(resolution,[status(thm)],[c22,c20]) ).

cnf(d1,plain,
    ( ~ defined(X1)
    | ~ defined(X0)
    | ~ 'less$uor$uequal'(add(X1,X0),X2)
    | 'less$uor$uequal'(add(X0,X1),X2) ),
    inference(resolution,[status(thm)],[c29,c7]) ).

cnf(d2,plain,
    ( ~ 'less$uor$uequal'(X0,X2)
    | ~ defined(X1)
    | 'less$uor$uequal'(add(X1,X0),add(X2,X1))
    | ~ defined(X1)
    | ~ defined(X0) ),
    inference(resolution,[status(thm)],[d1,c22]) ).

cnf(d3,plain,
    ( 'less$uor$uequal'(add(X3,X1),add(X2,X0))
    | ~ 'less$uor$uequal'(X3,X0)
    | ~ defined(X1)
    | ~ 'less$uor$uequal'(X1,X2)
    | ~ defined(X1)
    | ~ defined(X0) ),
    inference(resolution,[status(thm)],[d2,d0]) ).

cnf(d4,plain,
    ( ~ 'less$uor$uequal'(a,b)
    | ~ 'less$uor$uequal'(a,b)
    | ~ defined(b)
    | ~ defined(a) ),
    inference(resolution,[status(thm)],[d3,c3]) ).

cnf(d5,plain,
    ( ~ 'less$uor$uequal'(a,b)
    | ~ defined(b) ),
    inference(resolution,[status(thm)],[c0,d4]) ).

cnf(d6,plain,
    ~ 'less$uor$uequal'(a,b),
    inference(resolution,[status(thm)],[c1,d5]) ).

cnf(d7,plain,
    $false,
    inference(resolution,[status(thm)],[c2,d6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : FLD060-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n006.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 : Sun Sep 27 02:32:26 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 42.27/19.12  % SZS status Unsatisfiable for theBenchmark.p
% 42.27/19.12  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------