↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : MSC019+1 : TPTP v9.3.1. Released v4.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 : n015.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:50:57 AM UTC 2026

% Result   : Theorem 0.13s 10.45s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (  16 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  12   ~;   8   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   12 (   0 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(kb18,axiom,
    s_contains(s_g019,s_g013),
    file('theBenchmark.p',kb18) ).

fof(kb74,axiom,
    s_contains(s_g013,s_MX),
    file('theBenchmark.p',kb74) ).

fof(axiom1,axiom,
    ! [X,Y,Z] :
      ( ( s_contains(Y,Z)
        & s_contains(X,Y) )
     => s_contains(X,Z) ),
    file('theBenchmark.p',axiom1) ).

fof(mexico_in_america_1,conjecture,
    s_contains(s_g019,s_MX),
    file('theBenchmark.p',mexico_in_america_1) ).

fof(f_19_1,plain,
    s_contains(s_g019,s_g013),
    inference(fof_nnf,[status(thm)],[kb18]) ).

cnf(f_19_2,plain,
    s_contains(s_g019,s_g013),
    inference(clausify,[status(thm)],[f_19_1]) ).

fof(f_75_1,plain,
    s_contains(s_g013,s_MX),
    inference(fof_nnf,[status(thm)],[kb74]) ).

cnf(f_75_2,plain,
    s_contains(s_g013,s_MX),
    inference(clausify,[status(thm)],[f_75_1]) ).

fof(f_601_1,plain,
    ! [X,Y,Z] :
      ( s_contains(X,Z)
      | ~ s_contains(Y,Z)
      | ~ s_contains(X,Y) ),
    inference(fof_nnf,[status(thm)],[axiom1]) ).

fof(f_601_2,plain,
    ! [U_2,U_1,U_0] :
      ( s_contains(U_2,U_0)
      | ~ s_contains(U_1,U_0)
      | ~ s_contains(U_2,U_1) ),
    inference(variable_rename,[status(thm)],[f_601_1]) ).

cnf(f_601_3,plain,
    ( s_contains(U_2,U_0)
    | ~ s_contains(U_1,U_0)
    | ~ s_contains(U_2,U_1) ),
    inference(clausify,[status(thm)],[f_601_2]) ).

fof(f_604_1,negated_conjecture,
    ~ s_contains(s_g019,s_MX),
    inference(negate,[status(cth)],[mexico_in_america_1]) ).

fof(f_604_2,negated_conjecture,
    ~ s_contains(s_g019,s_MX),
    inference(definitional_conversion,[status(esa)],[f_604_1]) ).

cnf(f_604_3,negated_conjecture,
    ~ s_contains(s_g019,s_MX),
    inference(clausify,[status(thm)],[f_604_2]) ).

cnf(t1,plain,
    ~ s_contains(s_g019,s_MX),
    inference(start,[status(thm),parent(0:0)],[f_604_3]) ).

cnf(t2,plain,
    ( ~ s_contains(s_g013,s_MX)
    | ~ s_contains(s_g019,s_g013)
    | s_contains(s_g019,s_MX) ),
    inference(extension,[status(thm),parent(t1:1)],[f_601_3]) ).

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

cnf(t4,plain,
    s_contains(s_g019,s_g013),
    inference(extension,[status(thm),parent(t2:2)],[f_19_2]) ).

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

cnf(t6,plain,
    s_contains(s_g013,s_MX),
    inference(extension,[status(thm),parent(t2:3)],[f_75_2]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MSC019+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  This is a FOF_THM_RFO_NEQ problem
% 0.00/0.03  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/10.37  % Computer : n015.cluster.edu
% 0.09/10.37  % Model    : x86_64 x86_64
% 0.09/10.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.37  % Memory   : 8046.5625MB
% 0.09/10.37  % OS       : Linux 6.8.0-71-generic
% 0.09/10.37  % CPULimit : 300
% 0.09/10.37  % WCLimit  : 300
% 0.09/10.37  % DateTime : Sat Sep 19 16:26:43 UTC 2026
% 0.09/10.37  % CPUTime  : 
% 0.13/10.45  % SZS status Theorem for theBenchmark
% 0.13/10.45  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------