↑ Up

LisaST---0.9.UNS-CRf.s

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

% Result   : Unsatisfiable 13.58s 2.17s
% Output   : CNFRefutation 13.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (   8 unt;   0 nHn;   9 RR)
%            Number of literals    :   16 (   0 equ;   7 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    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   10 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(reflexivity,hypothesis,
    equalish(X0,X0) ).

cnf(transitivity,hypothesis,
    ( equalish(X1,X2)
    | ~ equalish(X0,X2)
    | ~ equalish(X0,X1) ) ).

cnf(a_equals_aa,hypothesis,
    equalish(a,aa) ).

cnf(prove_b_equals_a,negated_conjecture,
    ~ equalish(aa,a) ).

cnf(c0,plain,
    equalish(X0,X0),
    inference(clausification,[status(esa)],[reflexivity]) ).

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

cnf(c3,plain,
    equalish(a,aa),
    inference(clausification,[status(esa)],[a_equals_aa]) ).

cnf(c4,plain,
    ~ equalish(aa,a),
    inference(clausification,[status(esa)],[prove_b_equals_a]) ).

cnf(d0,plain,
    ( ~ equalish(X1,X0)
    | equalish(X0,X1) ),
    inference(resolution,[status(thm)],[c1,c0]) ).

cnf(d1,plain,
    equalish(aa,a),
    inference(resolution,[status(thm)],[d0,c3]) ).

cnf(d2,plain,
    $false,
    inference(resolution,[status(thm)],[c4,d1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM019-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n010.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.37  % DateTime : Sat Sep 26 01:53:59 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.58/2.17  % SZS status Unsatisfiable for theBenchmark.p
% 13.58/2.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------