↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : FLD033-3 : 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 : n020.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:38:54 AM UTC 2026

% Result   : Unsatisfiable 0.95s 1.23s
% Output   : Proof 0.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   21 (  15 unt;   2 nHn;  21 RR)
%            Number of literals    :   33 (   0 equ;  14 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   10 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity_multiplication_2,axiom,
    ( ~ product(X,V,W)
    | ~ product(Y,Z,V)
    | ~ product(X,Y,U)
    | product(U,Z,W) ),
    file('FLD002-0.ax',associativity_multiplication_2) ).

cnf(existence_of_inverse_multiplication,axiom,
    ( ~ defined(X)
    | sum(additive_identity,X,additive_identity)
    | product(multiplicative_inverse(X),X,multiplicative_identity) ),
    file('FLD002-0.ax',existence_of_inverse_multiplication) ).

cnf(commutativity_multiplication,axiom,
    ( ~ product(X,Y,Z)
    | product(Y,X,Z) ),
    file('FLD002-0.ax',commutativity_multiplication) ).

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

cnf(not_sum_3,negated_conjecture,
    ~ sum(additive_identity,a,additive_identity),
    file('theBenchmark.p',not_sum_3) ).

cnf(product_4,negated_conjecture,
    product(m,a,a),
    file('theBenchmark.p',product_4) ).

cnf(not_product_5,negated_conjecture,
    ~ product(multiplicative_identity,m,multiplicative_identity),
    file('theBenchmark.p',not_product_5) ).

cnf(t1,plain,
    ~ sum(additive_identity,a,additive_identity),
    inference(start,[status(thm),parent(0:0)],[not_sum_3]) ).

cnf(t2,plain,
    ( ~ defined(a)
    | product(multiplicative_inverse(a),a,multiplicative_identity)
    | sum(additive_identity,a,additive_identity) ),
    inference(extension,[status(thm),parent(t1:1)],[existence_of_inverse_multiplication]) ).

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

cnf(t4,plain,
    ( ~ product(multiplicative_inverse(a),a,multiplicative_identity)
    | ~ product(a,m,a)
    | product(multiplicative_identity,m,multiplicative_identity)
    | ~ product(multiplicative_inverse(a),a,multiplicative_identity) ),
    inference(extension,[status(thm),parent(t2:2)],[associativity_multiplication_2]) ).

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

cnf(t6,plain,
    ~ product(multiplicative_identity,m,multiplicative_identity),
    inference(extension,[status(thm),parent(t4:2)],[not_product_5]) ).

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

cnf(t8,plain,
    ( ~ product(m,a,a)
    | product(a,m,a) ),
    inference(extension,[status(thm),parent(t4:3)],[commutativity_multiplication]) ).

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

cnf(t10,plain,
    product(m,a,a),
    inference(extension,[status(thm),parent(t8:2)],[product_4]) ).

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

cnf(t12,plain,
    $false,
    inference(reduction,[status(thm),parent(t4:4)],[t4:4,t2:2]) ).

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

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : FLD033-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.02  This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.03  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.35  % Computer : n020.cluster.edu
% 0.06/0.35  % Model    : x86_64 x86_64
% 0.06/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.35  % Memory   : 8046.5625MB
% 0.06/0.35  % OS       : Linux 6.8.0-71-generic
% 0.06/0.35  % CPULimit : 300
% 0.06/0.35  % WCLimit  : 300
% 0.06/0.35  % DateTime : Sun Sep 20 18:54:17 UTC 2026
% 0.06/0.35  % CPUTime  : 
% 0.95/1.23  % SZS status Unsatisfiable for theBenchmark
% 0.95/1.23  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------