↑ Up

LisaST---0.9.UNS-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_X_times_id_is_X,negated_conjecture,
    multiply(a,identity) != a ).

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

cnf(total_function1,axiom,
    product(X0,X1,multiply(X0,X1)) ).

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

cnf(c0,plain,
    multiply(a,identity) != a,
    inference(clausification,[status(esa)],[prove_X_times_id_is_X]) ).

cnf(c2,plain,
    product(X0,identity,X0),
    inference(clausification,[status(esa)],[right_identity]) ).

cnf(c5,plain,
    product(X0,X1,multiply(X0,X1)),
    inference(clausification,[status(esa)],[total_function1]) ).

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

cnf(d0,plain,
    ( ~ product(X0,identity,X1)
    | X0 = X1 ),
    inference(resolution,[status(thm)],[c6,c2]) ).

cnf(d1,plain,
    X0 = multiply(X0,identity),
    inference(resolution,[status(thm)],[d0,c5]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : GRP018-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.17/0.42  % Computer : n009.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.42  % CPULimit : 300
% 0.17/0.42  % WCLimit  : 300
% 0.17/0.42  % DateTime : Fri Sep 25 14:16:44 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.95/2.39  % SZS status Unsatisfiable for theBenchmark.p
% 14.95/2.39  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------