↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n009.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:11:00 AM UTC 2026

% Result   : Unsatisfiable 9.76s 2.87s
% Output   : CNFRefutation 9.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (  13 unt;   0 nHn;  23 RR)
%            Number of literals    :   42 (   0 equ;  21 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(b_is_defined,hypothesis,
    defined(b) ).

cnf(less_or_equal_4,negated_conjecture,
    'less$uor$uequal'('additive$uidentity',a) ).

cnf(less_or_equal_5,negated_conjecture,
    'less$uor$uequal'('additive$uidentity',b) ).

cnf(sum_6,negated_conjecture,
    sum(a,b,c) ).

cnf(not_less_or_equal_7,negated_conjecture,
    ~ 'less$uor$uequal'('additive$uidentity',c) ).

cnf(existence_of_identity_addition,axiom,
    ( ~ defined(X0)
    | sum('additive$uidentity',X0,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,
    ( ~ sum(X3,X4,X1)
    | ~ sum(X2,X4,X0)
    | ~ 'less$uor$uequal'(X2,X3)
    | 'less$uor$uequal'(X0,X1) ) ).

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

cnf(c3,plain,
    'less$uor$uequal'('additive$uidentity',a),
    inference(clausification,[status(esa)],[less_or_equal_4]) ).

cnf(c4,plain,
    'less$uor$uequal'('additive$uidentity',b),
    inference(clausification,[status(esa)],[less_or_equal_5]) ).

cnf(c5,plain,
    sum(a,b,c),
    inference(clausification,[status(esa)],[sum_6]) ).

cnf(c6,plain,
    ~ 'less$uor$uequal'('additive$uidentity',c),
    inference(clausification,[status(esa)],[not_less_or_equal_7]) ).

cnf(c9,plain,
    ( ~ defined(X0)
    | sum('additive$uidentity',X0,X0) ),
    inference(clausification,[status(esa)],[existence_of_identity_addition]) ).

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

cnf(c30,plain,
    ( ~ sum(X3,X4,X1)
    | ~ sum(X2,X4,X0)
    | ~ 'less$uor$uequal'(X2,X3)
    | 'less$uor$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[compatibility_of_order_relation_and_addition]) ).

cnf(d0,plain,
    ( 'less$uor$uequal'('additive$uidentity',X0)
    | ~ 'less$uor$uequal'(b,X0) ),
    inference(resolution,[status(thm)],[c28,c4]) ).

cnf(d1,plain,
    ( ~ defined(X0)
    | ~ sum(X2,X0,X1)
    | ~ 'less$uor$uequal'('additive$uidentity',X2)
    | 'less$uor$uequal'(X0,X1) ),
    inference(resolution,[status(thm)],[c30,c9]) ).

cnf(d2,plain,
    ( ~ 'less$uor$uequal'('additive$uidentity',a)
    | 'less$uor$uequal'(b,c)
    | ~ defined(b) ),
    inference(resolution,[status(thm)],[d1,c5]) ).

cnf(d3,plain,
    ( ~ 'less$uor$uequal'('additive$uidentity',a)
    | 'less$uor$uequal'(b,c) ),
    inference(resolution,[status(thm)],[c1,d2]) ).

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

cnf(d5,plain,
    'less$uor$uequal'('additive$uidentity',c),
    inference(resolution,[status(thm)],[d4,d0]) ).

cnf(d6,plain,
    $false,
    inference(resolution,[status(thm)],[c6,d5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD070-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n009.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 27 02:34:44 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.76/2.87  % SZS status Unsatisfiable for theBenchmark.p
% 9.76/2.87  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------