↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Computer : n011.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:55:17 AM UTC 2026

% Result   : Unsatisfiable 30.45s 30.77s
% Output   : Proof 30.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   57 (  39 unt;   0 nHn;  53 RR)
%            Number of literals    :   85 (  62 equ;  30 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(commutativity_of_add,axiom,
    add(X,Y) = add(Y,X),
    file('ROB001-0.ax',commutativity_of_add) ).

cnf(associativity_of_add,axiom,
    add(add(X,Y),Z) = add(X,add(Y,Z)),
    file('ROB001-0.ax',associativity_of_add) ).

cnf(robbins_axiom,axiom,
    negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))) = X,
    file('ROB001-0.ax',robbins_axiom) ).

cnf(condition,hypothesis,
    negate(add(a,negate(add(b,c)))) = negate(add(b,negate(add(a,c)))),
    file('theBenchmark.p',condition) ).

cnf(prove_result,negated_conjecture,
    a != b,
    file('theBenchmark.p',prove_result) ).

cnf(equality_1,axiom,
    Eq_x_0 = Eq_x_0,
    theory(equality,[reflexivity]) ).

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(equality_4,axiom,
    ( add(Eq_x_0,Eq_x_1) = add(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_5,axiom,
    ( negate(Eq_x_0) = negate(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(t1,plain,
    a != b,
    inference(start,[status(thm),parent(0:0)],[prove_result]) ).

cnf(t2,plain,
    ( negate(add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c)))))) != b
    | a != negate(add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c))))))
    | a = b ),
    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,
    ( negate(add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c)))))) != a
    | a = negate(add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c)))))) ),
    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,
    negate(add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c)))))) = a,
    inference(extension,[status(thm),parent(t4:2)],[robbins_axiom]) ).

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

cnf(t8,plain,
    ( b != negate(add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c))))))
    | negate(add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c)))))) = b ),
    inference(extension,[status(thm),parent(t2:3)],[equality_2]) ).

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

cnf(t10,plain,
    ( negate(add(negate(add(b,add(a,c))),negate(add(b,negate(add(a,c)))))) != negate(add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c))))))
    | b != negate(add(negate(add(b,add(a,c))),negate(add(b,negate(add(a,c))))))
    | b = negate(add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c)))))) ),
    inference(extension,[status(thm),parent(t8:2)],[equality_3]) ).

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

cnf(t12,plain,
    ( negate(add(negate(add(b,add(a,c))),negate(add(b,negate(add(a,c)))))) != b
    | b = negate(add(negate(add(b,add(a,c))),negate(add(b,negate(add(a,c)))))) ),
    inference(extension,[status(thm),parent(t10:2)],[equality_2]) ).

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

cnf(t14,plain,
    negate(add(negate(add(b,add(a,c))),negate(add(b,negate(add(a,c)))))) = b,
    inference(extension,[status(thm),parent(t12:2)],[robbins_axiom]) ).

cnf(t15,plain,
    $false,
    inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).

cnf(t16,plain,
    ( add(negate(add(b,add(a,c))),negate(add(b,negate(add(a,c))))) != add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c)))))
    | negate(add(negate(add(b,add(a,c))),negate(add(b,negate(add(a,c)))))) = negate(add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c)))))) ),
    inference(extension,[status(thm),parent(t10:3)],[equality_5]) ).

cnf(t17,plain,
    $false,
    inference(connection,[status(thm),parent(t16:1)],[t16:1,t10:3]) ).

cnf(t18,plain,
    ( add(negate(add(b,negate(add(a,c)))),negate(add(b,add(a,c)))) != add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c)))))
    | add(negate(add(b,add(a,c))),negate(add(b,negate(add(a,c))))) != add(negate(add(b,negate(add(a,c)))),negate(add(b,add(a,c))))
    | add(negate(add(b,add(a,c))),negate(add(b,negate(add(a,c))))) = add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c))))) ),
    inference(extension,[status(thm),parent(t16:2)],[equality_3]) ).

cnf(t19,plain,
    $false,
    inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).

cnf(t20,plain,
    add(negate(add(b,add(a,c))),negate(add(b,negate(add(a,c))))) = add(negate(add(b,negate(add(a,c)))),negate(add(b,add(a,c)))),
    inference(extension,[status(thm),parent(t18:2)],[commutativity_of_add]) ).

cnf(t21,plain,
    $false,
    inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).

cnf(t22,plain,
    ( add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c))))) != add(negate(add(b,negate(add(a,c)))),negate(add(b,add(a,c))))
    | add(negate(add(b,negate(add(a,c)))),negate(add(b,add(a,c)))) = add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c))))) ),
    inference(extension,[status(thm),parent(t18:3)],[equality_2]) ).

cnf(t23,plain,
    $false,
    inference(connection,[status(thm),parent(t22:1)],[t22:1,t18:3]) ).

cnf(t24,plain,
    ( add(negate(add(a,negate(add(b,c)))),negate(add(a,add(b,c)))) != add(negate(add(b,negate(add(a,c)))),negate(add(b,add(a,c))))
    | add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c))))) != add(negate(add(a,negate(add(b,c)))),negate(add(a,add(b,c))))
    | add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c))))) = add(negate(add(b,negate(add(a,c)))),negate(add(b,add(a,c)))) ),
    inference(extension,[status(thm),parent(t22:2)],[equality_3]) ).

cnf(t25,plain,
    $false,
    inference(connection,[status(thm),parent(t24:1)],[t24:1,t22:2]) ).

cnf(t26,plain,
    add(negate(add(a,add(b,c))),negate(add(a,negate(add(b,c))))) = add(negate(add(a,negate(add(b,c)))),negate(add(a,add(b,c)))),
    inference(extension,[status(thm),parent(t24:2)],[commutativity_of_add]) ).

cnf(t27,plain,
    $false,
    inference(connection,[status(thm),parent(t26:1)],[t26:1,t24:2]) ).

cnf(t28,plain,
    ( negate(add(a,add(b,c))) != negate(add(b,add(a,c)))
    | negate(add(a,negate(add(b,c)))) != negate(add(b,negate(add(a,c))))
    | add(negate(add(a,negate(add(b,c)))),negate(add(a,add(b,c)))) = add(negate(add(b,negate(add(a,c)))),negate(add(b,add(a,c)))) ),
    inference(extension,[status(thm),parent(t24:3)],[equality_4]) ).

cnf(t29,plain,
    $false,
    inference(connection,[status(thm),parent(t28:1)],[t28:1,t24:3]) ).

cnf(t30,plain,
    negate(add(a,negate(add(b,c)))) = negate(add(b,negate(add(a,c)))),
    inference(extension,[status(thm),parent(t28:2)],[condition]) ).

cnf(t31,plain,
    $false,
    inference(connection,[status(thm),parent(t30:1)],[t30:1,t28:2]) ).

cnf(t32,plain,
    ( add(a,add(b,c)) != add(b,add(a,c))
    | negate(add(a,add(b,c))) = negate(add(b,add(a,c))) ),
    inference(extension,[status(thm),parent(t28:3)],[equality_5]) ).

cnf(t33,plain,
    $false,
    inference(connection,[status(thm),parent(t32:1)],[t32:1,t28:3]) ).

cnf(t34,plain,
    ( add(add(b,c),a) != add(b,add(a,c))
    | add(a,add(b,c)) != add(add(b,c),a)
    | add(a,add(b,c)) = add(b,add(a,c)) ),
    inference(extension,[status(thm),parent(t32:2)],[equality_3]) ).

cnf(t35,plain,
    $false,
    inference(connection,[status(thm),parent(t34:1)],[t34:1,t32:2]) ).

cnf(t36,plain,
    add(a,add(b,c)) = add(add(b,c),a),
    inference(extension,[status(thm),parent(t34:2)],[commutativity_of_add]) ).

cnf(t37,plain,
    $false,
    inference(connection,[status(thm),parent(t36:1)],[t36:1,t34:2]) ).

cnf(t38,plain,
    ( add(b,add(c,a)) != add(b,add(a,c))
    | add(add(b,c),a) != add(b,add(c,a))
    | add(add(b,c),a) = add(b,add(a,c)) ),
    inference(extension,[status(thm),parent(t34:3)],[equality_3]) ).

cnf(t39,plain,
    $false,
    inference(connection,[status(thm),parent(t38:1)],[t38:1,t34:3]) ).

cnf(t40,plain,
    add(add(b,c),a) = add(b,add(c,a)),
    inference(extension,[status(thm),parent(t38:2)],[associativity_of_add]) ).

cnf(t41,plain,
    $false,
    inference(connection,[status(thm),parent(t40:1)],[t40:1,t38:2]) ).

cnf(t42,plain,
    ( add(c,a) != add(a,c)
    | b != b
    | add(b,add(c,a)) = add(b,add(a,c)) ),
    inference(extension,[status(thm),parent(t38:3)],[equality_4]) ).

cnf(t43,plain,
    $false,
    inference(connection,[status(thm),parent(t42:1)],[t42:1,t38:3]) ).

cnf(t44,plain,
    b = b,
    inference(extension,[status(thm),parent(t42:2)],[equality_1]) ).

cnf(t45,plain,
    $false,
    inference(connection,[status(thm),parent(t44:1)],[t44:1,t42:2]) ).

cnf(t46,plain,
    add(c,a) = add(a,c),
    inference(extension,[status(thm),parent(t42:3)],[commutativity_of_add]) ).

cnf(t47,plain,
    $false,
    inference(connection,[status(thm),parent(t46:1)],[t46:1,t42:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ROB009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.04  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.38  % Computer : n011.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sat Sep 19 21:00:41 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 30.45/30.77  % SZS status Unsatisfiable for theBenchmark
% 30.45/30.77  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------