↑ Up

LisaST---0.9.UNS-CRf.s

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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_reflexivity,negated_conjecture,
    ~ equalish(a,a) ).

cnf(left_identity,axiom,
    product(identity,X0,X0) ).

cnf(total_function2,axiom,
    ( equalish(X2,X3)
    | ~ product(X0,X1,X3)
    | ~ product(X0,X1,X2) ) ).

cnf(c0,plain,
    ~ equalish(a,a),
    inference(clausification,[status(esa)],[prove_reflexivity]) ).

cnf(c1,plain,
    product(identity,X0,X0),
    inference(clausification,[status(esa)],[left_identity]) ).

cnf(c4,plain,
    ( equalish(X2,X3)
    | ~ product(X0,X1,X3)
    | ~ product(X0,X1,X2) ),
    inference(clausification,[status(esa)],[total_function2]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP041-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.56  % Computer : n007.cluster.edu
% 0.08/0.56  % Model    : x86_64 x86_64
% 0.08/0.56  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.56  % Memory   : 8046.5625MB
% 0.08/0.56  % OS       : Linux 6.8.0-71-generic
% 0.08/0.56  % CPULimit : 300
% 0.08/0.56  % WCLimit  : 300
% 0.08/0.56  % DateTime : Fri Sep 25 14:17:39 UTC 2026
% 0.08/0.56  % CPUTime  : 
% 0.08/0.56  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.88/2.38  % SZS status Unsatisfiable for theBenchmark.p
% 13.88/2.38  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------