↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : FLD059-1 : TPTP v9.3.1. Bugfixed v2.1.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 : n009.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:39:00 AM UTC 2026

% Result   : Unsatisfiable 9.36s 9.69s
% Output   : Proof 9.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   38 (  26 unt;   0 nHn;  38 RR)
%            Number of literals    :   60 (   0 equ;  24 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   12 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(existence_of_identity_addition,axiom,
    ( ~ defined(X)
    | equalish(add(additive_identity,X),X) ),
    file('FLD001-0.ax',existence_of_identity_addition) ).

cnf(commutativity_addition,axiom,
    ( ~ defined(Y)
    | ~ defined(X)
    | equalish(add(X,Y),add(Y,X)) ),
    file('FLD001-0.ax',commutativity_addition) ).

cnf(well_definedness_of_additive_identity,axiom,
    defined(additive_identity),
    file('FLD001-0.ax',well_definedness_of_additive_identity) ).

cnf(transitivity_of_order_relation,axiom,
    ( ~ less_or_equal(Y,Z)
    | ~ less_or_equal(X,Y)
    | less_or_equal(X,Z) ),
    file('FLD001-0.ax',transitivity_of_order_relation) ).

cnf(compatibility_of_order_relation_and_addition,axiom,
    ( ~ less_or_equal(X,Y)
    | ~ defined(Z)
    | less_or_equal(add(X,Z),add(Y,Z)) ),
    file('FLD001-0.ax',compatibility_of_order_relation_and_addition) ).

cnf(compatibility_of_equality_and_order_relation,axiom,
    ( ~ equalish(X,Y)
    | ~ less_or_equal(X,Z)
    | less_or_equal(Y,Z) ),
    file('FLD001-0.ax',compatibility_of_equality_and_order_relation) ).

cnf(a_is_defined,hypothesis,
    defined(a),
    file('theBenchmark.p',a_is_defined) ).

cnf(less_or_equal_2,negated_conjecture,
    less_or_equal(additive_identity,a),
    file('theBenchmark.p',less_or_equal_2) ).

cnf(not_less_or_equal_3,negated_conjecture,
    ~ less_or_equal(additive_identity,add(a,a)),
    file('theBenchmark.p',not_less_or_equal_3) ).

cnf(t1,plain,
    ~ less_or_equal(additive_identity,add(a,a)),
    inference(start,[status(thm),parent(0:0)],[not_less_or_equal_3]) ).

cnf(t2,plain,
    ( ~ less_or_equal(additive_identity,add(a,additive_identity))
    | ~ less_or_equal(add(a,additive_identity),add(a,a))
    | less_or_equal(additive_identity,add(a,a)) ),
    inference(extension,[status(thm),parent(t1:1)],[transitivity_of_order_relation]) ).

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

cnf(t4,plain,
    ( ~ less_or_equal(add(additive_identity,a),add(a,a))
    | ~ equalish(add(additive_identity,a),add(a,additive_identity))
    | less_or_equal(add(a,additive_identity),add(a,a)) ),
    inference(extension,[status(thm),parent(t2:2)],[compatibility_of_equality_and_order_relation]) ).

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

cnf(t6,plain,
    ( ~ defined(additive_identity)
    | ~ defined(a)
    | equalish(add(additive_identity,a),add(a,additive_identity)) ),
    inference(extension,[status(thm),parent(t4:2)],[commutativity_addition]) ).

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

cnf(t8,plain,
    defined(a),
    inference(extension,[status(thm),parent(t6:2)],[a_is_defined]) ).

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

cnf(t10,plain,
    defined(additive_identity),
    inference(extension,[status(thm),parent(t6:3)],[well_definedness_of_additive_identity]) ).

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

cnf(t12,plain,
    ( ~ defined(a)
    | ~ less_or_equal(additive_identity,a)
    | less_or_equal(add(additive_identity,a),add(a,a)) ),
    inference(extension,[status(thm),parent(t4:3)],[compatibility_of_order_relation_and_addition]) ).

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

cnf(t14,plain,
    less_or_equal(additive_identity,a),
    inference(extension,[status(thm),parent(t12:2)],[less_or_equal_2]) ).

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

cnf(t16,plain,
    defined(a),
    inference(extension,[status(thm),parent(t12:3)],[a_is_defined]) ).

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

cnf(t18,plain,
    ( ~ less_or_equal(add(additive_identity,additive_identity),add(a,additive_identity))
    | ~ equalish(add(additive_identity,additive_identity),additive_identity)
    | less_or_equal(additive_identity,add(a,additive_identity)) ),
    inference(extension,[status(thm),parent(t2:3)],[compatibility_of_equality_and_order_relation]) ).

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

cnf(t20,plain,
    ( ~ defined(additive_identity)
    | equalish(add(additive_identity,additive_identity),additive_identity) ),
    inference(extension,[status(thm),parent(t18:2)],[existence_of_identity_addition]) ).

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

cnf(t22,plain,
    defined(additive_identity),
    inference(extension,[status(thm),parent(t20:2)],[well_definedness_of_additive_identity]) ).

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

cnf(t24,plain,
    ( ~ defined(additive_identity)
    | ~ less_or_equal(additive_identity,a)
    | less_or_equal(add(additive_identity,additive_identity),add(a,additive_identity)) ),
    inference(extension,[status(thm),parent(t18:3)],[compatibility_of_order_relation_and_addition]) ).

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

cnf(t26,plain,
    less_or_equal(additive_identity,a),
    inference(extension,[status(thm),parent(t24:2)],[less_or_equal_2]) ).

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

cnf(t28,plain,
    defined(additive_identity),
    inference(extension,[status(thm),parent(t24:3)],[well_definedness_of_additive_identity]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD059-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03  This is a CNF_UNS_RFO_NEQ_NHN 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.10/0.37  % Computer : n009.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 20 19:09:58 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 9.36/9.69  % SZS status Unsatisfiable for theBenchmark
% 9.36/9.69  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------