↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : GEO032-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 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 : 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:39:18 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(d7,axiom,
    equidistant(U,U,V,V),
    file('theBenchmark.p',d7) ).

cnf(d12,axiom,
    ( equidistant(V,X,V1,X1)
    | ~ between(U1,V1,W1)
    | ~ between(U,V,W)
    | ~ equidistant(W,X,W1,X1)
    | ~ equidistant(U,X,U1,X1)
    | ~ equidistant(U,W,U1,W1)
    | ~ equidistant(U,V,U1,V1) ),
    file('theBenchmark.p',d12) ).

cnf(v_between_u_and_w,hypothesis,
    between(u,v,w),
    file('theBenchmark.p',v_between_u_and_w) ).

cnf(v1_between_u1_and_w1,hypothesis,
    between(u1,v1,w1),
    file('theBenchmark.p',v1_between_u1_and_w1) ).

cnf(u_to_v_equals_u1_to_v1,hypothesis,
    equidistant(u,v,u1,v1),
    file('theBenchmark.p',u_to_v_equals_u1_to_v1) ).

cnf(u_to_w_equals_u1_to_w1,hypothesis,
    equidistant(u,w,u1,w1),
    file('theBenchmark.p',u_to_w_equals_u1_to_w1) ).

cnf(v_to_w_equals_v1_to_w1,negated_conjecture,
    ~ equidistant(v,w,v1,w1),
    file('theBenchmark.p',v_to_w_equals_v1_to_w1) ).

cnf(t1,plain,
    ~ equidistant(v,w,v1,w1),
    inference(start,[status(thm),parent(0:0)],[v_to_w_equals_v1_to_w1]) ).

cnf(t2,plain,
    ( ~ equidistant(u,w,u1,w1)
    | ~ equidistant(u,w,u1,w1)
    | ~ equidistant(w,w,w1,w1)
    | ~ between(u,v,w)
    | ~ between(u1,v1,w1)
    | ~ equidistant(u,v,u1,v1)
    | equidistant(v,w,v1,w1) ),
    inference(extension,[status(thm),parent(t1:1)],[d12]) ).

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

cnf(t4,plain,
    equidistant(u,v,u1,v1),
    inference(extension,[status(thm),parent(t2:2)],[u_to_v_equals_u1_to_v1]) ).

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

cnf(t6,plain,
    between(u1,v1,w1),
    inference(extension,[status(thm),parent(t2:3)],[v1_between_u1_and_w1]) ).

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

cnf(t8,plain,
    between(u,v,w),
    inference(extension,[status(thm),parent(t2:4)],[v_between_u_and_w]) ).

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

cnf(t10,plain,
    equidistant(w,w,w1,w1),
    inference(extension,[status(thm),parent(t2:5)],[d7]) ).

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

cnf(t12,plain,
    equidistant(u,w,u1,w1),
    inference(extension,[status(thm),parent(t2:6)],[u_to_w_equals_u1_to_w1]) ).

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

cnf(l6,lemma,
    equidistant(u,w,u1,w1),
    inference(lemma,[status(cth),parent(t2:6),below(t1:1)],[t2:6]) ).

cnf(t14,plain,
    equidistant(u,w,u1,w1),
    inference(lemma_extension,[status(thm),parent(t2:7)],[l6:1]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO032-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03  This is a CNF_UNS_RFO_SEQ_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.08/0.34  % Computer : n007.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Sat Sep 19 07:14:20 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 1.24/1.55  % SZS status Unsatisfiable for theBenchmark
% 1.24/1.55  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------