↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : RNG040-2 : TPTP v9.3.1. Released v1.0.0.
% 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 : n006.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:54:59 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(distributivity1,axiom,
    ( sum(V1,V2,V4)
    | ~ product(X,V3,V4)
    | ~ sum(Y,Z,V3)
    | ~ product(X,Z,V2)
    | ~ product(X,Y,V1) ),
    file('theBenchmark.p',distributivity1) ).

cnf(product_symmetry,hypothesis,
    ( product(B,A,C)
    | ~ product(A,B,C) ),
    file('theBenchmark.p',product_symmetry) ).

cnf(b_plus_c,negated_conjecture,
    sum(b,c,d),
    file('theBenchmark.p',b_plus_c) ).

cnf(d_plus_a,negated_conjecture,
    product(d,a,additive_identity),
    file('theBenchmark.p',d_plus_a) ).

cnf(b_plus_a,negated_conjecture,
    product(b,a,l),
    file('theBenchmark.p',b_plus_a) ).

cnf(c_plus_a,negated_conjecture,
    product(c,a,n),
    file('theBenchmark.p',c_plus_a) ).

cnf(prove_equation,negated_conjecture,
    ~ sum(l,n,additive_identity),
    file('theBenchmark.p',prove_equation) ).

cnf(t1,plain,
    ~ sum(l,n,additive_identity),
    inference(start,[status(thm),parent(0:0)],[prove_equation]) ).

cnf(t2,plain,
    ( ~ product(a,c,n)
    | ~ sum(b,c,d)
    | ~ product(a,d,additive_identity)
    | ~ product(a,b,l)
    | sum(l,n,additive_identity) ),
    inference(extension,[status(thm),parent(t1:1)],[distributivity1]) ).

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

cnf(t4,plain,
    ( ~ product(b,a,l)
    | product(a,b,l) ),
    inference(extension,[status(thm),parent(t2:2)],[product_symmetry]) ).

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

cnf(t6,plain,
    product(b,a,l),
    inference(extension,[status(thm),parent(t4:2)],[b_plus_a]) ).

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

cnf(t8,plain,
    ( ~ product(d,a,additive_identity)
    | product(a,d,additive_identity) ),
    inference(extension,[status(thm),parent(t2:3)],[product_symmetry]) ).

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

cnf(t10,plain,
    product(d,a,additive_identity),
    inference(extension,[status(thm),parent(t8:2)],[d_plus_a]) ).

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

cnf(t12,plain,
    sum(b,c,d),
    inference(extension,[status(thm),parent(t2:4)],[b_plus_c]) ).

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

cnf(t14,plain,
    ( ~ product(c,a,n)
    | product(a,c,n) ),
    inference(extension,[status(thm),parent(t2:5)],[product_symmetry]) ).

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

cnf(t16,plain,
    product(c,a,n),
    inference(extension,[status(thm),parent(t14:2)],[c_plus_a]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : RNG040-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_SEQ_NHN 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.08/0.35  % Computer : n006.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 19 20:44:27 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 29.95/30.21  % SZS status Unsatisfiable for theBenchmark
% 29.95/30.21  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------