↑ Up

LisaST---0.9.UNS-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(another_right_identity,hypothesis,
    product(X0,c,X0) ).

cnf(prove_identity_equals_c,negated_conjecture,
    identity != c ).

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

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

cnf(c1,plain,
    product(X0,c,X0),
    inference(clausification,[status(esa)],[another_right_identity]) ).

cnf(c2,plain,
    identity != c,
    inference(clausification,[status(esa)],[prove_identity_equals_c]) ).

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

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

cnf(d0,plain,
    ( ~ product(X1,c,X0)
    | X0 = X1 ),
    inference(resolution,[status(thm)],[c8,c1]) ).

cnf(d1,plain,
    c = identity,
    inference(resolution,[status(thm)],[d0,c3]) ).

cnf(d2,plain,
    identity != identity,
    inference(demodulation,[status(thm)],[c2,d1]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GRP007-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44  % Computer : n007.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.44  % WCLimit  : 300
% 0.19/0.44  % DateTime : Fri Sep 25 14:13:55 UTC 2026
% 0.19/0.44  % CPUTime  : 
% 0.19/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.00/2.32  % SZS status Unsatisfiable for theBenchmark.p
% 13.00/2.32  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------