↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

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

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

cnf(t1,axiom,
    ( between(W,V,U)
    | ~ between(U,V,W) ),
    file('theBenchmark.p',t1) ).

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

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

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

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

cnf(t4,plain,
    between(b,a,a),
    inference(extension,[status(thm),parent(t2:2)],[t3]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO002-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.07/0.34  % Computer : n008.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.34  % CPULimit : 300
% 0.07/0.34  % WCLimit  : 300
% 0.07/0.34  % DateTime : Sat Sep 19 07:18:38 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.21/0.52  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.52  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------