↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : GEO055-3 : 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 : n001.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:22 AM UTC 2026

% Result   : Unsatisfiable 122.43s 127.74s
% Output   : Proof 122.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   35 (  30 unt;   0 nHn;  28 RR)
%            Number of literals    :   54 (  23 equ;  21 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-4 aty)
%            Number of variables   :   36 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(segment_construction2,axiom,
    equidistant(Y,extension(X,Y,W,V),W,V),
    file('GEO002-0.ax',segment_construction2) ).

cnf(reflection,axiom,
    reflection(U,V) = extension(U,V,U,V),
    file('GEO002-2.ax',reflection) ).

cnf(d1,axiom,
    equidistant(U,V,U,V),
    file('theBenchmark.p',d1) ).

cnf(d5,axiom,
    ( equidistant(U,V,Y,Z)
    | ~ equidistant(W,X,Y,Z)
    | ~ equidistant(U,V,W,X) ),
    file('theBenchmark.p',d5) ).

cnf(e1,axiom,
    V = extension(U,V,W,W),
    file('theBenchmark.p',e1) ).

cnf(prove_equidistance,negated_conjecture,
    ~ equidistant(v,reflection(u,v),u,v),
    file('theBenchmark.p',prove_equidistance) ).

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

cnf(equality_10,axiom,
    ( equidistant(Eq_y_0,Eq_y_1,Eq_y_2,Eq_y_3)
    | ~ equidistant(Eq_x_0,Eq_x_1,Eq_x_2,Eq_x_3)
    | Eq_x_3 != Eq_y_3
    | Eq_x_2 != Eq_y_2
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(t1,plain,
    ~ equidistant(v,reflection(u,v),u,v),
    inference(start,[status(thm),parent(0:0)],[prove_equidistance]) ).

cnf(t2,plain,
    ( ~ equidistant(extension(U_1952,v,U_1953,U_1953),extension(u,v,u,v),u,v)
    | ~ equidistant(v,reflection(u,v),extension(U_1952,v,U_1953,U_1953),extension(u,v,u,v))
    | equidistant(v,reflection(u,v),u,v) ),
    inference(extension,[status(thm),parent(t1:1)],[d5]) ).

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

cnf(t4,plain,
    ( reflection(u,v) != reflection(u,v)
    | v != extension(U_1952,v,U_1953,U_1953)
    | reflection(u,v) != extension(u,v,u,v)
    | ~ equidistant(v,reflection(u,v),v,reflection(u,v))
    | v != v
    | equidistant(v,reflection(u,v),extension(U_1952,v,U_1953,U_1953),extension(u,v,u,v)) ),
    inference(extension,[status(thm),parent(t2:2)],[equality_10]) ).

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

cnf(t6,plain,
    v = v,
    inference(extension,[status(thm),parent(t4:2)],[equality_1]) ).

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

cnf(t8,plain,
    equidistant(v,reflection(u,v),v,reflection(u,v)),
    inference(extension,[status(thm),parent(t4:3)],[d1]) ).

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

cnf(t10,plain,
    reflection(u,v) = extension(u,v,u,v),
    inference(extension,[status(thm),parent(t4:4)],[reflection]) ).

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

cnf(t12,plain,
    v = extension(U_1952,v,U_1953,U_1953),
    inference(extension,[status(thm),parent(t4:5)],[e1]) ).

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

cnf(t14,plain,
    reflection(u,v) = reflection(u,v),
    inference(extension,[status(thm),parent(t4:6)],[equality_1]) ).

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

cnf(t16,plain,
    ( extension(u,v,u,v) != extension(u,v,u,v)
    | u != u
    | v != v
    | ~ equidistant(v,extension(u,v,u,v),u,v)
    | v != extension(U_1952,v,U_1953,U_1953)
    | equidistant(extension(U_1952,v,U_1953,U_1953),extension(u,v,u,v),u,v) ),
    inference(extension,[status(thm),parent(t2:3)],[equality_10]) ).

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

cnf(t18,plain,
    v = extension(U_1952,v,U_1953,U_1953),
    inference(extension,[status(thm),parent(t16:2)],[e1]) ).

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

cnf(t20,plain,
    equidistant(v,extension(u,v,u,v),u,v),
    inference(extension,[status(thm),parent(t16:3)],[segment_construction2]) ).

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

cnf(t22,plain,
    v = v,
    inference(extension,[status(thm),parent(t16:4)],[equality_1]) ).

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

cnf(t24,plain,
    u = u,
    inference(extension,[status(thm),parent(t16:5)],[equality_1]) ).

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

cnf(t26,plain,
    extension(u,v,u,v) = extension(u,v,u,v),
    inference(extension,[status(thm),parent(t16:6)],[equality_1]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO055-3 : 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.10/5.36  % Computer : n001.cluster.edu
% 0.10/5.36  % Model    : x86_64 x86_64
% 0.10/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.36  % Memory   : 8046.5625MB
% 0.10/5.36  % OS       : Linux 6.8.0-71-generic
% 0.10/5.36  % CPULimit : 300
% 0.10/5.36  % WCLimit  : 300
% 0.10/5.36  % DateTime : Sat Sep 19 07:19:31 UTC 2026
% 0.10/5.36  % CPUTime  : 
% 122.43/127.74  % SZS status Unsatisfiable for theBenchmark
% 122.43/127.74  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------