↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : FLD030-1 : 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 : n001.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:49 AM UTC 2026

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

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

cnf(a_equals_d_4,negated_conjecture,
    equalish(a,d) ).

cnf(multiply_not_equal_to_multiply_5,negated_conjecture,
    ~ equalish(multiply(d,b),multiply(a,b)) ).

cnf(symmetry_of_equality,axiom,
    ( ~ equalish(X1,X0)
    | equalish(X0,X1) ) ).

cnf(compatibility_of_equality_and_multiplication,axiom,
    ( ~ equalish(X0,X2)
    | ~ defined(X1)
    | equalish(multiply(X0,X1),multiply(X2,X1)) ) ).

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

cnf(c3,plain,
    equalish(a,d),
    inference(clausification,[status(esa)],[a_equals_d_4]) ).

cnf(c4,plain,
    ~ equalish(multiply(d,b),multiply(a,b)),
    inference(clausification,[status(esa)],[multiply_not_equal_to_multiply_5]) ).

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

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

cnf(d0,plain,
    ( ~ equalish(d,a)
    | ~ defined(b) ),
    inference(resolution,[status(thm)],[c29,c4]) ).

cnf(d1,plain,
    ~ equalish(d,a),
    inference(resolution,[status(thm)],[c1,d0]) ).

cnf(d2,plain,
    equalish(d,a),
    inference(resolution,[status(thm)],[c26,c3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD030-1 : 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.09/0.36  % Computer : n001.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 : Sun Sep 27 02:30:44 UTC 2026
% 0.14/0.36  % CPUTime  : 
% 0.14/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.23/1.83  % SZS status Unsatisfiable for theBenchmark.p
% 11.23/1.83  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------