↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : GEO003-3 : TPTP v9.3.1. Released v1.0.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 : n003.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:12 AM UTC 2026

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

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

cnf(b0,axiom,
    ( between(U,V,Y)
    | Y != extension(U,V,W,X) ),
    file('theBenchmark.p',b0) ).

cnf(prove_b_between_a_and_b,negated_conjecture,
    ~ between(a,b,b),
    file('theBenchmark.p',prove_b_between_a_and_b) ).

cnf(t1,plain,
    ~ between(a,b,b),
    inference(start,[status(thm),parent(0:0)],[prove_b_between_a_and_b]) ).

cnf(t2,plain,
    ( b != extension(a,b,U_1142,U_1142)
    | between(a,b,b) ),
    inference(extension,[status(thm),parent(t1:1)],[b0]) ).

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

cnf(t4,plain,
    b = extension(a,b,U_1142,U_1142),
    inference(extension,[status(thm),parent(t2:2)],[e1]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO003-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.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.09/0.36  % Computer : n003.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 19 07:10:43 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.43  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.43  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------