↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 220.04s 38.66s
% Output   : CNFRefutation 220.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   25 (  12 unt;   0 nHn;  25 RR)
%            Number of literals    :   58 (   0 equ;  39 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn)

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

cnf(c_is_defined,hypothesis,
    defined(c) ).

cnf(a_equals_b_5,negated_conjecture,
    equalish(a,b) ).

cnf(c_equals_d_6,negated_conjecture,
    equalish(c,d) ).

cnf(add_not_equal_to_add_7,negated_conjecture,
    ~ equalish(add(a,c),add(d,b)) ).

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

cnf(transitivity_of_equality,axiom,
    ( ~ equalish(X2,X1)
    | ~ equalish(X0,X2)
    | equalish(X0,X1) ) ).

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

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

cnf(c2,plain,
    defined(c),
    inference(clausification,[status(esa)],[c_is_defined]) ).

cnf(c4,plain,
    equalish(a,b),
    inference(clausification,[status(esa)],[a_equals_b_5]) ).

cnf(c5,plain,
    equalish(c,d),
    inference(clausification,[status(esa)],[c_equals_d_6]) ).

cnf(c6,plain,
    ~ equalish(add(a,c),add(d,b)),
    inference(clausification,[status(esa)],[add_not_equal_to_add_7]) ).

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

cnf(c29,plain,
    ( ~ equalish(X2,X1)
    | ~ equalish(X0,X2)
    | equalish(X0,X1) ),
    inference(clausification,[status(esa)],[transitivity_of_equality]) ).

cnf(c30,plain,
    ( ~ equalish(X0,X2)
    | ~ defined(X1)
    | equalish(add(X0,X1),add(X2,X1)) ),
    inference(clausification,[status(esa)],[compatibility_of_equality_and_addition]) ).

cnf(d0,plain,
    ( ~ equalish(X3,add(X1,X0))
    | equalish(X3,add(X2,X0))
    | ~ equalish(X1,X2)
    | ~ defined(X0) ),
    inference(resolution,[status(thm)],[c30,c29]) ).

cnf(d1,plain,
    ( ~ defined(X2)
    | ~ defined(X1)
    | ~ equalish(X0,add(X2,X1))
    | equalish(X0,add(X1,X2)) ),
    inference(resolution,[status(thm)],[c29,c10]) ).

cnf(d2,plain,
    ( ~ equalish(X2,X0)
    | ~ defined(X1)
    | equalish(add(X2,X1),add(X1,X0))
    | ~ defined(X1)
    | ~ defined(X0) ),
    inference(resolution,[status(thm)],[d1,c30]) ).

cnf(d3,plain,
    ( ~ equalish(X0,X3)
    | equalish(add(X2,X0),add(X3,X1))
    | ~ defined(X1)
    | ~ equalish(X2,X1)
    | ~ defined(X1)
    | ~ defined(X0) ),
    inference(resolution,[status(thm)],[d2,d0]) ).

cnf(d4,plain,
    ( ~ equalish(c,d)
    | ~ equalish(a,b)
    | ~ defined(c)
    | ~ defined(b) ),
    inference(resolution,[status(thm)],[d3,c6]) ).

cnf(d5,plain,
    ( ~ equalish(c,d)
    | ~ equalish(a,b)
    | ~ defined(c) ),
    inference(resolution,[status(thm)],[c1,d4]) ).

cnf(d6,plain,
    ( ~ equalish(c,d)
    | ~ equalish(a,b) ),
    inference(resolution,[status(thm)],[c2,d5]) ).

cnf(d7,plain,
    ~ equalish(c,d),
    inference(resolution,[status(thm)],[c4,d6]) ).

cnf(d8,plain,
    $false,
    inference(resolution,[status(thm)],[c5,d7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : FLD013-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44  % Computer : n014.cluster.edu
% 0.19/0.44  % Model    : x86_64 x86_64
% 0.19/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44  % Memory   : 8046.5625MB
% 0.19/0.44  % OS       : Linux 6.8.0-71-generic
% 0.19/0.44  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Sun Sep 27 02:22:47 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.45  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 220.04/38.66  % SZS status Unsatisfiable for theBenchmark.p
% 220.04/38.66  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------