↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n010.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:20:41 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(symmetryish,axiom,
    ( equalish(X1,X0)
    | ~ equalish(X0,X1) ) ).

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

cnf(c_19,negated_conjecture,
    ~ equalish(m,n) ).

cnf(c_20,negated_conjecture,
    equalish(n,k) ).

cnf(c_23,negated_conjecture,
    equalish(m,k) ).

cnf(c1,plain,
    ( equalish(X1,X0)
    | ~ equalish(X0,X1) ),
    inference(clausification,[status(esa)],[symmetryish]) ).

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

cnf(c21,plain,
    ~ equalish(m,n),
    inference(clausification,[status(esa)],[c_19]) ).

cnf(c22,plain,
    equalish(n,k),
    inference(clausification,[status(esa)],[c_20]) ).

cnf(c25,plain,
    equalish(m,k),
    inference(clausification,[status(esa)],[c_23]) ).

cnf(d0,plain,
    equalish(k,n),
    inference(resolution,[status(thm)],[c22,c1]) ).

cnf(d1,plain,
    ( ~ equalish(X0,k)
    | equalish(X0,n) ),
    inference(resolution,[status(thm)],[d0,c2]) ).

cnf(d2,plain,
    equalish(m,n),
    inference(resolution,[status(thm)],[d1,c25]) ).

cnf(d3,plain,
    $false,
    inference(resolution,[status(thm)],[c21,d2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN014-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n010.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 17:04:31 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.54/1.82  % SZS status Unsatisfiable for theBenchmark.p
% 11.54/1.82  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------