↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : BOO012-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 : n014.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 76.92s 14.07s
% Output   : CNFRefutation 76.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   38 (  21 unt;   0 nHn;  21 RR)
%            Number of literals    :   75 (   9 equ;  40 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   93 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_inverse_is_an_involution,negated_conjecture,
    inverse(inverse(x)) != x ).

cnf(closure_of_addition,axiom,
    sum(X0,X1,add(X0,X1)) ).

cnf(commutativity_of_addition,axiom,
    ( sum(X1,X0,X2)
    | ~ sum(X0,X1,X2) ) ).

cnf(additive_identity1,axiom,
    sum('additive$uidentity',X0,X0) ).

cnf(additive_identity2,axiom,
    sum(X0,'additive$uidentity',X0) ).

cnf(distributivity5,axiom,
    ( product(X2,X4,X6)
    | ~ sum(X0,X5,X6)
    | ~ product(X1,X3,X5)
    | ~ sum(X0,X3,X4)
    | ~ sum(X0,X1,X2) ) ).

cnf(distributivity8,axiom,
    ( sum(X5,X1,X6)
    | ~ product(X2,X4,X6)
    | ~ product(X0,X3,X5)
    | ~ sum(X3,X1,X4)
    | ~ sum(X0,X1,X2) ) ).

cnf(additive_inverse2,axiom,
    sum(X0,inverse(X0),'multiplicative$uidentity') ).

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

cnf(multiplicative_inverse2,axiom,
    product(X0,inverse(X0),'additive$uidentity') ).

cnf(addition_is_well_defined,axiom,
    ( X2 = X3
    | ~ sum(X0,X1,X3)
    | ~ sum(X0,X1,X2) ) ).

cnf(c0,plain,
    inverse(inverse(x)) != x,
    inference(clausification,[status(esa)],[prove_inverse_is_an_involution]) ).

cnf(c1,plain,
    sum(X0,X1,add(X0,X1)),
    inference(clausification,[status(esa)],[closure_of_addition]) ).

cnf(c3,plain,
    ( sum(X1,X0,X2)
    | ~ sum(X0,X1,X2) ),
    inference(clausification,[status(esa)],[commutativity_of_addition]) ).

cnf(c5,plain,
    sum('additive$uidentity',X0,X0),
    inference(clausification,[status(esa)],[additive_identity1]) ).

cnf(c6,plain,
    sum(X0,'additive$uidentity',X0),
    inference(clausification,[status(esa)],[additive_identity2]) ).

cnf(c13,plain,
    ( ~ sum(X0,X6,X4)
    | ~ product(X5,X1,X6)
    | ~ sum(X0,X5,X3)
    | product(X3,X2,X4)
    | ~ sum(X0,X1,X2) ),
    inference(clausification,[status(esa)],[distributivity5]) ).

cnf(c16,plain,
    ( ~ product(X5,X2,X6)
    | sum(X4,X1,X6)
    | ~ sum(X3,X1,X5)
    | ~ product(X3,X0,X4)
    | ~ sum(X0,X1,X2) ),
    inference(clausification,[status(esa)],[distributivity8]) ).

cnf(c18,plain,
    sum(X0,inverse(X0),'multiplicative$uidentity'),
    inference(clausification,[status(esa)],[additive_inverse2]) ).

cnf(c19,plain,
    product(inverse(X0),X0,'additive$uidentity'),
    inference(clausification,[status(esa)],[multiplicative_inverse1]) ).

cnf(c20,plain,
    product(X0,inverse(X0),'additive$uidentity'),
    inference(clausification,[status(esa)],[multiplicative_inverse2]) ).

cnf(c21,plain,
    ( X2 = X3
    | ~ sum(X0,X1,X3)
    | ~ sum(X0,X1,X2) ),
    inference(clausification,[status(esa)],[addition_is_well_defined]) ).

cnf(d0,plain,
    ( ~ sum('additive$uidentity',X1,X0)
    | X0 = X1 ),
    inference(resolution,[status(thm)],[c21,c5]) ).

cnf(d1,plain,
    sum(X0,X1,add(X1,X0)),
    inference(resolution,[status(thm)],[c3,c1]) ).

cnf(d2,plain,
    ( ~ sum(X1,X2,X0)
    | X0 = add(X1,X2) ),
    inference(resolution,[status(thm)],[c21,c1]) ).

cnf(d3,plain,
    add(X0,X1) = add(X1,X0),
    inference(resolution,[status(thm)],[d2,d1]) ).

cnf(d4,plain,
    ( ~ product('multiplicative$uidentity',X4,X2)
    | ~ product(X1,X3,X0)
    | ~ sum(X3,inverse(X1),X4)
    | sum(X0,inverse(X1),X2) ),
    inference(resolution,[status(thm)],[c16,c18]) ).

cnf(d5,plain,
    ( ~ product('multiplicative$uidentity',add(inverse(X1),X3),X2)
    | ~ product(X1,X3,X0)
    | sum(X0,inverse(X1),X2) ),
    inference(resolution,[status(thm)],[d4,d1]) ).

cnf(d6,plain,
    ( ~ product('multiplicative$uidentity',add(inverse(inverse(X0)),X0),X1)
    | sum('additive$uidentity',inverse(inverse(X0)),X1) ),
    inference(resolution,[status(thm)],[d5,c19]) ).

cnf(d7,plain,
    ( ~ product('multiplicative$uidentity',add(X0,inverse(inverse(X0))),X1)
    | sum('additive$uidentity',inverse(inverse(X0)),X1) ),
    inference(demodulation,[status(thm)],[d6,d3]) ).

cnf(d8,plain,
    ( ~ product(X3,X5,X1)
    | product(X4,add(X0,X5),X2)
    | ~ sum(X0,X3,X4)
    | ~ sum(X0,X1,X2) ),
    inference(resolution,[status(thm)],[c13,c1]) ).

cnf(d9,plain,
    ( ~ product(inverse(X0),X3,X1)
    | product('multiplicative$uidentity',add(X0,X3),X2)
    | ~ sum(X0,X1,X2) ),
    inference(resolution,[status(thm)],[d8,c18]) ).

cnf(d10,plain,
    ( product('multiplicative$uidentity',add(X0,X1),X0)
    | ~ product(inverse(X0),X1,'additive$uidentity') ),
    inference(resolution,[status(thm)],[d9,c6]) ).

cnf(d11,plain,
    product('multiplicative$uidentity',add(X0,inverse(inverse(X0))),X0),
    inference(resolution,[status(thm)],[d10,c20]) ).

cnf(d12,plain,
    sum('additive$uidentity',inverse(inverse(X0)),X0),
    inference(resolution,[status(thm)],[d11,d7]) ).

cnf(d13,plain,
    X0 = inverse(inverse(X0)),
    inference(resolution,[status(thm)],[d12,d0]) ).

cnf(d14,plain,
    x != x,
    inference(demodulation,[status(thm)],[c0,d13]) ).

cnf(d15,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : BOO012-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35  % Computer : n014.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Sat Sep 26 22:34:46 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.35  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 76.92/14.07  % SZS status Unsatisfiable for theBenchmark.p
% 76.92/14.07  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------