↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n017.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 10.46s 7.74s
% Output   : CNFRefutation 10.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (   8 unt;   0 nHn;   6 RR)
%            Number of literals    :   16 (   6 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

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

cnf(left_inverse,axiom,
    product(inverse(X0),X0,identity) ).

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(inverse(a),a) != identity,
    inference(clausification,[status(esa)],[prove_inverse_X_times_X_is_id]) ).

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

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,X1,X2)
    | multiply(X0,X1) = X2 ),
    inference(resolution,[status(thm)],[c6,c5]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP020-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/5.39  % Computer : n017.cluster.edu
% 0.12/5.39  % Model    : x86_64 x86_64
% 0.12/5.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39  % Memory   : 8046.5625MB
% 0.12/5.39  % OS       : Linux 6.8.0-71-generic
% 0.12/5.39  % CPULimit : 300
% 0.12/5.39  % WCLimit  : 300
% 0.12/5.39  % DateTime : Fri Sep 25 14:12:24 UTC 2026
% 0.12/5.39  % CPUTime  : 
% 0.12/5.39  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.46/7.74  % SZS status Unsatisfiable for theBenchmark.p
% 10.46/7.74  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------