↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n010.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 06:54:42 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_inverse_of_1_is_0,negated_conjecture,
    inverse('multiplicative$uidentity') != 'additive$uidentity' ).

cnf(commutativity_of_multiply,axiom,
    multiply(X0,X1) = multiply(X1,X0) ).

cnf(multiplicative_id1,axiom,
    multiply(X0,'multiplicative$uidentity') = X0 ).

cnf(multiplicative_inverse1,axiom,
    multiply(X0,inverse(X0)) = 'additive$uidentity' ).

cnf(c0,plain,
    inverse('multiplicative$uidentity') != 'additive$uidentity',
    inference(clausification,[status(esa)],[prove_inverse_of_1_is_0]) ).

cnf(c2,plain,
    multiply(X0,X1) = multiply(X1,X0),
    inference(clausification,[status(esa)],[commutativity_of_multiply]) ).

cnf(c6,plain,
    multiply(X0,'multiplicative$uidentity') = X0,
    inference(clausification,[status(esa)],[multiplicative_id1]) ).

cnf(c8,plain,
    multiply(X0,inverse(X0)) = 'additive$uidentity',
    inference(clausification,[status(esa)],[multiplicative_inverse1]) ).

cnf(d0,plain,
    X0 = multiply('multiplicative$uidentity',X0),
    inference(superposition,[status(thm)],[c6,c2]) ).

cnf(d1,plain,
    inverse('multiplicative$uidentity') = 'additive$uidentity',
    inference(superposition,[status(thm)],[d0,c8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : BOO018-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n010.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 26 22:37:16 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.51/1.64  % SZS status Unsatisfiable for theBenchmark.p
% 9.51/1.64  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------