↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : AGT005+2 : TPTP v9.3.1. Bugfixed v3.1.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:11:29 AM UTC 2026

% Result   : Theorem 2.07s 2.37s
% Output   : Proof 2.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   27 (  21 unt;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   52 (  22   ~;  18   |;  11   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   24 (   0 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(a1_1,axiom,
    ! [A,C,N,L] :
      ( accept_team(A,L,C,N)
    <=> ( accept_number(A,N)
        & accept_leader(A,L)
        & accept_city(A,C) ) ),
    file('AGT001+0.ax',a1_1) ).

fof(deduced_83,axiom,
    accept_city(christiansufferterrahumanitarianorganization,towna),
    file('AGT001+2.ax',deduced_83) ).

fof(deduced_84,axiom,
    accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
    file('AGT001+2.ax',deduced_84) ).

fof(deduced_166,axiom,
    accept_number(christiansufferterrahumanitarianorganization,n3),
    file('AGT001+2.ax',deduced_166) ).

fof(query_5,conjecture,
    accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
    file('theBenchmark.p',query_5) ).

fof(f_1_1,plain,
    ! [A,C,N,L] :
      ( ( accept_team(A,L,C,N)
        | ~ accept_number(A,N)
        | ~ accept_leader(A,L)
        | ~ accept_city(A,C) )
      & ( ( accept_number(A,N)
          & accept_leader(A,L)
          & accept_city(A,C) )
        | ~ accept_team(A,L,C,N) ) ),
    inference(fof_nnf,[status(thm)],[a1_1]) ).

fof(f_1_2,plain,
    ! [U_3,U_2,U_1,U_0] :
      ( ( accept_team(U_3,U_0,U_2,U_1)
        | ~ accept_number(U_3,U_1)
        | ~ accept_leader(U_3,U_0)
        | ~ accept_city(U_3,U_2) )
      & ( ( accept_number(U_3,U_1)
          & accept_leader(U_3,U_0)
          & accept_city(U_3,U_2) )
        | ~ accept_team(U_3,U_0,U_2,U_1) ) ),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

fof(f_1_3,plain,
    ( ! [U_11,U_9,U_7,U_5] :
        ( accept_team(U_11,U_5,U_9,U_7)
        | ~ accept_number(U_11,U_7)
        | ~ accept_leader(U_11,U_5)
        | ~ accept_city(U_11,U_9) )
    & ! [U_10,U_8,U_6,U_4] :
        ( ( accept_number(U_10,U_6)
          & accept_leader(U_10,U_4)
          & accept_city(U_10,U_8) )
        | ~ accept_team(U_10,U_4,U_8,U_6) ) ),
    inference(miniscope,[status(thm)],[f_1_2]) ).

cnf(f_1_7,plain,
    ( accept_team(U_11,U_5,U_9,U_7)
    | ~ accept_number(U_11,U_7)
    | ~ accept_leader(U_11,U_5)
    | ~ accept_city(U_11,U_9) ),
    inference(clausify,[status(thm)],[f_1_3]) ).

fof(f_352_1,plain,
    accept_city(christiansufferterrahumanitarianorganization,towna),
    inference(fof_nnf,[status(thm)],[deduced_83]) ).

cnf(f_352_2,plain,
    accept_city(christiansufferterrahumanitarianorganization,towna),
    inference(clausify,[status(thm)],[f_352_1]) ).

fof(f_353_1,plain,
    accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
    inference(fof_nnf,[status(thm)],[deduced_84]) ).

cnf(f_353_2,plain,
    accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
    inference(clausify,[status(thm)],[f_353_1]) ).

fof(f_435_1,plain,
    accept_number(christiansufferterrahumanitarianorganization,n3),
    inference(fof_nnf,[status(thm)],[deduced_166]) ).

cnf(f_435_2,plain,
    accept_number(christiansufferterrahumanitarianorganization,n3),
    inference(clausify,[status(thm)],[f_435_1]) ).

fof(f_923_1,negated_conjecture,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
    inference(negate,[status(cth)],[query_5]) ).

fof(f_923_2,negated_conjecture,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
    inference(definitional_conversion,[status(esa)],[f_923_1]) ).

cnf(f_923_3,negated_conjecture,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
    inference(clausify,[status(thm)],[f_923_2]) ).

cnf(t1,plain,
    ~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3),
    inference(start,[status(thm),parent(0:0)],[f_923_3]) ).

cnf(t2,plain,
    ( ~ accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization)
    | ~ accept_number(christiansufferterrahumanitarianorganization,n3)
    | ~ accept_city(christiansufferterrahumanitarianorganization,towna)
    | accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n3) ),
    inference(extension,[status(thm),parent(t1:1)],[f_1_7]) ).

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

cnf(t4,plain,
    accept_city(christiansufferterrahumanitarianorganization,towna),
    inference(extension,[status(thm),parent(t2:2)],[f_352_2]) ).

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

cnf(t6,plain,
    accept_number(christiansufferterrahumanitarianorganization,n3),
    inference(extension,[status(thm),parent(t2:3)],[f_435_2]) ).

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

cnf(t8,plain,
    accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
    inference(extension,[status(thm),parent(t2:4)],[f_353_2]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : AGT005+2 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.03  This is a FOF_THM_RFO_SEQ 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.08/0.36  % Computer : n008.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sun Sep 20 08:32:54 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 2.07/2.37  % SZS status Theorem for theBenchmark
% 2.07/2.37  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------