↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : GEO038-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 : n019.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:19 AM UTC 2026

% Result   : Unsatisfiable 205.69s 221.26s
% Output   : Proof 205.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   24 (  17 unt;   0 nHn;  22 RR)
%            Number of literals    :   37 (  15 equ;  15 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-4 aty)
%            Number of variables   :   17 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(reflexivity_for_equidistance,axiom,
    equidistant(X,Y,Y,X),
    file('GEO002-0.ax',reflexivity_for_equidistance) ).

cnf(identity_for_equidistance,axiom,
    ( X = Y
    | ~ equidistant(X,Y,Z,Z) ),
    file('GEO002-0.ax',identity_for_equidistance) ).

cnf(segment_construction1,axiom,
    between(X,Y,extension(X,Y,W,V)),
    file('GEO002-0.ax',segment_construction1) ).

cnf(y_is_extension,hypothesis,
    y = extension(u,v,w,x),
    file('theBenchmark.p',y_is_extension) ).

cnf(prove_corollary,negated_conjecture,
    ~ between(u,v,y),
    file('theBenchmark.p',prove_corollary) ).

cnf(equality_2,axiom,
    ( Eq_x_1 = Eq_x_0
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[symmetry]) ).

cnf(equality_10,axiom,
    ( between(Eq_y_0,Eq_y_1,Eq_y_2)
    | ~ between(Eq_x_0,Eq_x_1,Eq_x_2)
    | 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,
    ~ between(u,v,y),
    inference(start,[status(thm),parent(0:0)],[prove_corollary]) ).

cnf(t2,plain,
    ( extension(u,v,w,x) != y
    | u != u
    | ~ between(u,v,extension(u,v,w,x))
    | v != v
    | between(u,v,y) ),
    inference(extension,[status(thm),parent(t1:1)],[equality_10]) ).

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

cnf(t4,plain,
    ( ~ equidistant(v,v,v,v)
    | v = v ),
    inference(extension,[status(thm),parent(t2:2)],[identity_for_equidistance]) ).

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

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

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

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

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

cnf(t10,plain,
    ( ~ equidistant(u,u,u,u)
    | u = u ),
    inference(extension,[status(thm),parent(t2:4)],[identity_for_equidistance]) ).

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

cnf(t12,plain,
    equidistant(u,u,u,u),
    inference(extension,[status(thm),parent(t10:2)],[reflexivity_for_equidistance]) ).

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

cnf(t14,plain,
    ( y != extension(u,v,w,x)
    | extension(u,v,w,x) = y ),
    inference(extension,[status(thm),parent(t2:5)],[equality_2]) ).

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

cnf(t16,plain,
    y = extension(u,v,w,x),
    inference(extension,[status(thm),parent(t14:2)],[y_is_extension]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO038-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.11/15.59  % Computer : n019.cluster.edu
% 0.11/15.59  % Model    : x86_64 x86_64
% 0.11/15.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/15.59  % Memory   : 8046.5625MB
% 0.11/15.59  % OS       : Linux 6.8.0-71-generic
% 0.11/15.59  % CPULimit : 300
% 0.11/15.59  % WCLimit  : 300
% 0.11/15.59  % DateTime : Sat Sep 19 07:16:08 UTC 2026
% 0.11/15.59  % CPUTime  : 
% 205.69/221.26  % SZS status Unsatisfiable for theBenchmark
% 205.69/221.26  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------