↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : BOO011-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n007.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 : Thu Sep 24 08:13:57 AM UTC 2026

% Result   : Unsatisfiable 0.10s 0.38s
% Output   : Proof 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (  14 unt;   0 nHn;  16 RR)
%            Number of literals    :   27 (  21 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   2 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(commutativity_of_add,axiom,
    add(X,Y) = add(Y,X),
    file('BOO004-0.ax',commutativity_of_add) ).

cnf(additive_id1,axiom,
    add(X,additive_identity) = X,
    file('BOO004-0.ax',additive_id1) ).

cnf(additive_inverse1,axiom,
    add(X,inverse(X)) = multiplicative_identity,
    file('BOO004-0.ax',additive_inverse1) ).

cnf(prove_inverse_of_1_is_0,negated_conjecture,
    inverse(additive_identity) != multiplicative_identity,
    file('theBenchmark.p',prove_inverse_of_1_is_0) ).

cnf(equality_2,axiom,
    ( Eq_x_1 = Eq_x_0
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[symmetry]) ).

cnf(equality_3,axiom,
    ( Eq_x_0 = Eq_x_2
    | Eq_x_1 != Eq_x_2
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[transitivity]) ).

cnf(t1,plain,
    inverse(additive_identity) != multiplicative_identity,
    inference(start,[status(thm),parent(0:0)],[prove_inverse_of_1_is_0]) ).

cnf(t2,plain,
    ( add(inverse(additive_identity),additive_identity) != multiplicative_identity
    | inverse(additive_identity) != add(inverse(additive_identity),additive_identity)
    | inverse(additive_identity) = multiplicative_identity ),
    inference(extension,[status(thm),parent(t1:1)],[equality_3]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).

cnf(t4,plain,
    ( add(inverse(additive_identity),additive_identity) != inverse(additive_identity)
    | inverse(additive_identity) = add(inverse(additive_identity),additive_identity) ),
    inference(extension,[status(thm),parent(t2:2)],[equality_2]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).

cnf(t6,plain,
    add(inverse(additive_identity),additive_identity) = inverse(additive_identity),
    inference(extension,[status(thm),parent(t4:2)],[additive_id1]) ).

cnf(t7,plain,
    $false,
    inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).

cnf(t8,plain,
    ( add(additive_identity,inverse(additive_identity)) != multiplicative_identity
    | add(inverse(additive_identity),additive_identity) != add(additive_identity,inverse(additive_identity))
    | add(inverse(additive_identity),additive_identity) = multiplicative_identity ),
    inference(extension,[status(thm),parent(t2:3)],[equality_3]) ).

cnf(t9,plain,
    $false,
    inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:3]) ).

cnf(t10,plain,
    add(inverse(additive_identity),additive_identity) = add(additive_identity,inverse(additive_identity)),
    inference(extension,[status(thm),parent(t8:2)],[commutativity_of_add]) ).

cnf(t11,plain,
    $false,
    inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).

cnf(t12,plain,
    add(additive_identity,inverse(additive_identity)) = multiplicative_identity,
    inference(extension,[status(thm),parent(t8:3)],[additive_inverse1]) ).

cnf(t13,plain,
    $false,
    inference(connection,[status(thm),parent(t12:1)],[t12:1,t8:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : BOO011-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03  This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n007.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 20 13:27:19 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------