↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : RNG002-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 : 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 08:25:32 AM UTC 2026

% Result   : Unsatisfiable 16.13s 4.21s
% Output   : CNFRefutation 16.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   36 (  25 unt;   0 nHn;  28 RR)
%            Number of literals    :   54 (  13 equ;  21 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   50 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(a_plus_b_is_d,hypothesis,
    sum(a,b,d) ).

cnf(a_plus_c_is_d,hypothesis,
    sum(a,c,d) ).

cnf(prove_b_equals_c,negated_conjecture,
    b != c ).

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

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

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

cnf(associativity_of_addition2,axiom,
    ( sum(X2,X3,X5)
    | ~ sum(X0,X4,X5)
    | ~ sum(X1,X3,X4)
    | ~ sum(X0,X1,X2) ) ).

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

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

cnf(c0,plain,
    sum(a,b,d),
    inference(clausification,[status(esa)],[a_plus_b_is_d]) ).

cnf(c1,plain,
    sum(a,c,d),
    inference(clausification,[status(esa)],[a_plus_c_is_d]) ).

cnf(c2,plain,
    b != c,
    inference(clausification,[status(esa)],[prove_b_equals_c]) ).

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

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

cnf(c8,plain,
    sum(X0,'additive$uinverse'(X0),'additive$uidentity'),
    inference(clausification,[status(esa)],[right_inverse]) ).

cnf(c10,plain,
    ( sum(X2,X3,X5)
    | ~ sum(X0,X4,X5)
    | ~ sum(X1,X3,X4)
    | ~ sum(X0,X1,X2) ),
    inference(clausification,[status(esa)],[associativity_of_addition2]) ).

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

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

cnf(d0,plain,
    sum(X0,X1,add(X1,X0)),
    inference(resolution,[status(thm)],[c11,c6]) ).

cnf(d1,plain,
    ( ~ sum(X1,X2,X0)
    | X0 = add(X1,X2) ),
    inference(resolution,[status(thm)],[c18,c6]) ).

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

cnf(d3,plain,
    ( ~ sum(X2,X1,X0)
    | X0 = add(X1,X2) ),
    inference(resolution,[status(thm)],[d0,c18]) ).

cnf(d4,plain,
    sum(b,a,d),
    inference(resolution,[status(thm)],[c11,c0]) ).

cnf(d5,plain,
    ( ~ sum(X2,X3,X0)
    | ~ sum(X3,X1,'additive$uidentity')
    | sum(X0,X1,X2) ),
    inference(resolution,[status(thm)],[c10,c4]) ).

cnf(d6,plain,
    ( sum(d,X0,b)
    | ~ sum(a,X0,'additive$uidentity') ),
    inference(resolution,[status(thm)],[d5,d4]) ).

cnf(d7,plain,
    sum(d,'additive$uinverse'(a),b),
    inference(resolution,[status(thm)],[d6,c8]) ).

cnf(d8,plain,
    b = add('additive$uinverse'(a),d),
    inference(resolution,[status(thm)],[d7,d3]) ).

cnf(d9,plain,
    b = add(d,'additive$uinverse'(a)),
    inference(demodulation,[status(thm)],[d8,d2]) ).

cnf(d10,plain,
    sum(c,a,d),
    inference(resolution,[status(thm)],[c11,c1]) ).

cnf(d11,plain,
    ( sum(d,X0,c)
    | ~ sum(a,X0,'additive$uidentity') ),
    inference(resolution,[status(thm)],[d5,d10]) ).

cnf(d12,plain,
    sum(d,'additive$uinverse'(a),c),
    inference(resolution,[status(thm)],[d11,c8]) ).

cnf(d13,plain,
    c = add('additive$uinverse'(a),d),
    inference(resolution,[status(thm)],[d12,d3]) ).

cnf(d14,plain,
    c = add(d,'additive$uinverse'(a)),
    inference(demodulation,[status(thm)],[d13,d2]) ).

cnf(d15,plain,
    c = b,
    inference(demodulation,[status(thm)],[d14,d9]) ).

cnf(d16,plain,
    b != b,
    inference(demodulation,[status(thm)],[c2,d15]) ).

cnf(d17,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : RNG002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44  % Computer : n014.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Sat Sep 26 05:43:16 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.13/4.21  % SZS status Unsatisfiable for theBenchmark.p
% 16.13/4.21  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------