↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n003.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:39 AM UTC 2026

% Result   : Unsatisfiable 10.10s 1.67s
% Output   : CNFRefutation 10.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    9 (   9 unt;   0 nHn;   5 RR)
%            Number of literals    :    9 (   8 equ;   3 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   :    4 (   0 sgn)

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

cnf(additive_inverse1,axiom,
    add(X0,inverse(X0)) = 'multiplicative$uidentity' ).

cnf(additive_id2,axiom,
    add('additive$uidentity',X0) = X0 ).

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

cnf(c7,plain,
    add(X0,inverse(X0)) = 'multiplicative$uidentity',
    inference(clausification,[status(esa)],[additive_inverse1]) ).

cnf(c14,plain,
    add('additive$uidentity',X0) = X0,
    inference(clausification,[status(esa)],[additive_id2]) ).

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

cnf(d1,plain,
    'multiplicative$uidentity' != 'multiplicative$uidentity',
    inference(demodulation,[status(thm)],[c0,d0]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : BOO011-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36  % Computer : n003.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sat Sep 26 22:36:56 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.10/1.67  % SZS status Unsatisfiable for theBenchmark.p
% 10.10/1.67  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------