↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : MGT041+2 : TPTP v9.3.1. Released v2.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 : n018.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:42 AM UTC 2026

% Result   : Theorem 0.11s 0.39s
% Output   : Proof 0.11s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(mp_not_high_and_low,axiom,
    ! [X,T] :
      ~ ( number_of_routines(X,T,high)
        & number_of_routines(X,T,low) ),
    file('theBenchmark.p',mp_not_high_and_low) ).

fof(a14,hypothesis,
    ! [X,T] :
      ( ( founding_time(X,T)
        & efficient_producer(X)
        & organisation_at_time(X,T) )
     => has_elaborated_routines(X,T) ),
    file('theBenchmark.p',a14) ).

fof(a15,hypothesis,
    ! [X,T] :
      ( ( founding_time(X,T)
        & first_mover(X)
        & organisation_at_time(X,T) )
     => number_of_routines(X,T,low) ),
    file('theBenchmark.p',a15) ).

fof(a16,hypothesis,
    ? [X,T] :
      ( ~ has_elaborated_routines(X,T)
      & number_of_routines(X,T,high)
      & founding_time(X,T)
      & organisation_at_time(X,T) ),
    file('theBenchmark.p',a16) ).

fof(prove_t10,conjecture,
    ? [X,T] :
      ( ~ efficient_producer(X)
      & ~ first_mover(X)
      & organisation_at_time(X,T) ),
    file('theBenchmark.p',prove_t10) ).

fof(f_1_1,plain,
    ! [X,T] :
      ( ~ number_of_routines(X,T,high)
      | ~ number_of_routines(X,T,low) ),
    inference(fof_nnf,[status(thm)],[mp_not_high_and_low]) ).

fof(f_1_2,plain,
    ! [U_1,U_0] :
      ( ~ number_of_routines(U_1,U_0,high)
      | ~ number_of_routines(U_1,U_0,low) ),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

cnf(f_1_3,plain,
    ( ~ number_of_routines(U_1,U_0,high)
    | ~ number_of_routines(U_1,U_0,low) ),
    inference(clausify,[status(thm)],[f_1_2]) ).

fof(f_2_1,plain,
    ! [X,T] :
      ( has_elaborated_routines(X,T)
      | ~ founding_time(X,T)
      | ~ efficient_producer(X)
      | ~ organisation_at_time(X,T) ),
    inference(fof_nnf,[status(thm)],[a14]) ).

fof(f_2_2,plain,
    ! [U_3,U_2] :
      ( has_elaborated_routines(U_3,U_2)
      | ~ founding_time(U_3,U_2)
      | ~ efficient_producer(U_3)
      | ~ organisation_at_time(U_3,U_2) ),
    inference(variable_rename,[status(thm)],[f_2_1]) ).

cnf(f_2_3,plain,
    ( has_elaborated_routines(U_3,U_2)
    | ~ founding_time(U_3,U_2)
    | ~ efficient_producer(U_3)
    | ~ organisation_at_time(U_3,U_2) ),
    inference(clausify,[status(thm)],[f_2_2]) ).

fof(f_3_1,plain,
    ! [X,T] :
      ( number_of_routines(X,T,low)
      | ~ founding_time(X,T)
      | ~ first_mover(X)
      | ~ organisation_at_time(X,T) ),
    inference(fof_nnf,[status(thm)],[a15]) ).

fof(f_3_2,plain,
    ! [U_5,U_4] :
      ( number_of_routines(U_5,U_4,low)
      | ~ founding_time(U_5,U_4)
      | ~ first_mover(U_5)
      | ~ organisation_at_time(U_5,U_4) ),
    inference(variable_rename,[status(thm)],[f_3_1]) ).

cnf(f_3_3,plain,
    ( number_of_routines(U_5,U_4,low)
    | ~ founding_time(U_5,U_4)
    | ~ first_mover(U_5)
    | ~ organisation_at_time(U_5,U_4) ),
    inference(clausify,[status(thm)],[f_3_2]) ).

fof(f_4_1,plain,
    ? [X,T] :
      ( ~ has_elaborated_routines(X,T)
      & number_of_routines(X,T,high)
      & founding_time(X,T)
      & organisation_at_time(X,T) ),
    inference(fof_nnf,[status(thm)],[a16]) ).

fof(f_4_2,plain,
    ? [U_7,U_6] :
      ( ~ has_elaborated_routines(U_7,U_6)
      & number_of_routines(U_7,U_6,high)
      & founding_time(U_7,U_6)
      & organisation_at_time(U_7,U_6) ),
    inference(variable_rename,[status(thm)],[f_4_1]) ).

fof(f_4_3,plain,
    ? [U_6] :
      ( ~ has_elaborated_routines(sK1,U_6)
      & number_of_routines(sK1,U_6,high)
      & founding_time(sK1,U_6)
      & organisation_at_time(sK1,U_6) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_7,sK1)],[f_4_2]) ).

fof(f_4_4,plain,
    ( ~ has_elaborated_routines(sK1,sK2)
    & number_of_routines(sK1,sK2,high)
    & founding_time(sK1,sK2)
    & organisation_at_time(sK1,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_6,sK2)],[f_4_3]) ).

cnf(f_4_5,plain,
    organisation_at_time(sK1,sK2),
    inference(clausify,[status(thm)],[f_4_4]) ).

cnf(f_4_6,plain,
    founding_time(sK1,sK2),
    inference(clausify,[status(thm)],[f_4_4]) ).

cnf(f_4_7,plain,
    number_of_routines(sK1,sK2,high),
    inference(clausify,[status(thm)],[f_4_4]) ).

cnf(f_4_8,plain,
    ~ has_elaborated_routines(sK1,sK2),
    inference(clausify,[status(thm)],[f_4_4]) ).

fof(f_5_1,negated_conjecture,
    ~ ? [X,T] :
        ( ~ efficient_producer(X)
        & ~ first_mover(X)
        & organisation_at_time(X,T) ),
    inference(negate,[status(cth)],[prove_t10]) ).

fof(f_5_2,negated_conjecture,
    ! [X,T] :
      ( efficient_producer(X)
      | first_mover(X)
      | ~ organisation_at_time(X,T) ),
    inference(fof_nnf,[status(thm)],[f_5_1]) ).

fof(f_5_3,negated_conjecture,
    ! [U_9,U_8] :
      ( efficient_producer(U_9)
      | first_mover(U_9)
      | ~ organisation_at_time(U_9,U_8) ),
    inference(variable_rename,[status(thm)],[f_5_2]) ).

fof(f_5_4,negated_conjecture,
    ! [U_9] :
      ( ! [U_8] : ~ organisation_at_time(U_9,U_8)
      | efficient_producer(U_9)
      | first_mover(U_9) ),
    inference(miniscope,[status(thm)],[f_5_3]) ).

fof(f_5_5,negated_conjecture,
    ! [U_8,U_9] :
      ( ~ organisation_at_time(U_9,U_8)
      | efficient_producer(U_9)
      | first_mover(U_9) ),
    inference(definitional_conversion,[status(esa)],[f_5_4]) ).

cnf(f_5_6,negated_conjecture,
    ( ~ organisation_at_time(U_9,U_8)
    | efficient_producer(U_9)
    | first_mover(U_9) ),
    inference(clausify,[status(thm)],[f_5_5]) ).

cnf(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03  This is a FOF_THM_RFO_NEQ 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/0.37  % Computer : n018.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sat Sep 19 16:16:41 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.39  % SZS status Theorem for theBenchmark
% 0.11/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------