%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.ANBBQGJJ8g true
% Computer : n020.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 : Tue Sep 8 06:25:14 AM UTC 2026
% Result : Theorem 0.48s 0.75s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 64 ( 0 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 202 ( 35 ~; 25 |; 12 &; 128 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 26 ( 0 ^; 20 !; 6 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(efficient_producer_type,type,
efficient_producer: $i > $o ).
thf(sk__1_type,type,
sk__1: $i ).
thf(number_of_routines_type,type,
number_of_routines: $i > $i > $i > $o ).
thf(sk__type,type,
sk_: $i ).
thf(low_type,type,
low: $i ).
thf(first_mover_type,type,
first_mover: $i > $o ).
thf(organisation_at_time_type,type,
organisation_at_time: $i > $i > $o ).
thf(founding_time_type,type,
founding_time: $i > $i > $o ).
thf(high_type,type,
high: $i ).
thf(has_elaborated_routines_type,type,
has_elaborated_routines: $i > $i > $o ).
thf(a16,axiom,
? [X: $i,T: $i] :
( ~ ( has_elaborated_routines @ X @ T )
& ( number_of_routines @ X @ T @ high )
& ( founding_time @ X @ T )
& ( organisation_at_time @ X @ T ) ) ).
thf(zip_derived_cl3,plain,
organisation_at_time @ sk_ @ sk__1,
inference(cnf,[status(esa)],[a16]) ).
thf(prove_t10,conjecture,
? [X: $i,T: $i] :
( ~ ( efficient_producer @ X )
& ~ ( first_mover @ X )
& ( organisation_at_time @ X @ T ) ) ).
thf(zf_stmt_0,negated_conjecture,
~ ? [X: $i,T: $i] :
( ~ ( efficient_producer @ X )
& ~ ( first_mover @ X )
& ( organisation_at_time @ X @ T ) ),
inference('cnf.neg',[status(esa)],[prove_t10]) ).
thf(zip_derived_cl7,plain,
! [X0: $i,X1: $i] :
( ( efficient_producer @ X0 )
| ( first_mover @ X0 )
| ~ ( organisation_at_time @ X0 @ X1 ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(a14,axiom,
! [X: $i,T: $i] :
( ( ( organisation_at_time @ X @ T )
& ( efficient_producer @ X )
& ( founding_time @ X @ T ) )
=> ( has_elaborated_routines @ X @ T ) ) ).
thf(zip_derived_cl1,plain,
! [X0: $i,X1: $i] :
( ~ ( efficient_producer @ X0 )
| ~ ( organisation_at_time @ X0 @ X1 )
| ~ ( founding_time @ X0 @ X1 )
| ( has_elaborated_routines @ X0 @ X1 ) ),
inference(cnf,[status(esa)],[a14]) ).
thf(zip_derived_cl6,plain,
~ ( has_elaborated_routines @ sk_ @ sk__1 ),
inference(cnf,[status(esa)],[a16]) ).
thf(zip_derived_cl8,plain,
( ~ ( founding_time @ sk_ @ sk__1 )
| ~ ( organisation_at_time @ sk_ @ sk__1 )
| ~ ( efficient_producer @ sk_ ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl1,zip_derived_cl6]) ).
thf(zip_derived_cl9,plain,
! [X0: $i] :
( ~ ( organisation_at_time @ sk_ @ X0 )
| ( first_mover @ sk_ )
| ~ ( organisation_at_time @ sk_ @ sk__1 )
| ~ ( founding_time @ sk_ @ sk__1 ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl7,zip_derived_cl8]) ).
thf(a15,axiom,
! [X: $i,T: $i] :
( ( ( organisation_at_time @ X @ T )
& ( first_mover @ X )
& ( founding_time @ X @ T ) )
=> ( number_of_routines @ X @ T @ low ) ) ).
thf(zip_derived_cl2,plain,
! [X0: $i,X1: $i] :
( ~ ( first_mover @ X0 )
| ~ ( organisation_at_time @ X0 @ X1 )
| ~ ( founding_time @ X0 @ X1 )
| ( number_of_routines @ X0 @ X1 @ low ) ),
inference(cnf,[status(esa)],[a15]) ).
thf(zip_derived_cl10,plain,
! [X0: $i,X1: $i] :
( ~ ( founding_time @ sk_ @ sk__1 )
| ~ ( organisation_at_time @ sk_ @ sk__1 )
| ~ ( organisation_at_time @ sk_ @ X1 )
| ( number_of_routines @ sk_ @ X0 @ low )
| ~ ( founding_time @ sk_ @ X0 )
| ~ ( organisation_at_time @ sk_ @ X0 ) ),
inference('dp-resolution',[status(thm)],[zip_derived_cl9,zip_derived_cl2]) ).
thf(zip_derived_cl4,plain,
founding_time @ sk_ @ sk__1,
inference(cnf,[status(esa)],[a16]) ).
thf(zip_derived_cl3_001,plain,
organisation_at_time @ sk_ @ sk__1,
inference(cnf,[status(esa)],[a16]) ).
thf(zip_derived_cl11,plain,
! [X0: $i,X1: $i] :
( ~ ( organisation_at_time @ sk_ @ X1 )
| ( number_of_routines @ sk_ @ X0 @ low )
| ~ ( founding_time @ sk_ @ X0 )
| ~ ( organisation_at_time @ sk_ @ X0 ) ),
inference(demod,[status(thm)],[zip_derived_cl10,zip_derived_cl4,zip_derived_cl3]) ).
thf(zip_derived_cl12,plain,
! [X0: $i] :
( ~ ( organisation_at_time @ sk_ @ X0 )
| ( number_of_routines @ sk_ @ X0 @ low )
| ~ ( founding_time @ sk_ @ X0 ) ),
inference(condensation,[status(thm)],[zip_derived_cl11]) ).
thf(zip_derived_cl13,plain,
( ( number_of_routines @ sk_ @ sk__1 @ low )
| ~ ( founding_time @ sk_ @ sk__1 ) ),
inference('s_sup-',[status(thm)],[zip_derived_cl3,zip_derived_cl12]) ).
thf(zip_derived_cl4_002,plain,
founding_time @ sk_ @ sk__1,
inference(cnf,[status(esa)],[a16]) ).
thf(zip_derived_cl14,plain,
number_of_routines @ sk_ @ sk__1 @ low,
inference(demod,[status(thm)],[zip_derived_cl13,zip_derived_cl4]) ).
thf(mp_not_high_and_low,axiom,
! [X: $i,T: $i] :
~ ( ( number_of_routines @ X @ T @ low )
& ( number_of_routines @ X @ T @ high ) ) ).
thf(zip_derived_cl0,plain,
! [X0: $i,X1: $i] :
( ~ ( number_of_routines @ X0 @ X1 @ low )
| ~ ( number_of_routines @ X0 @ X1 @ high ) ),
inference(cnf,[status(esa)],[mp_not_high_and_low]) ).
thf(zip_derived_cl15,plain,
~ ( number_of_routines @ sk_ @ sk__1 @ high ),
inference('s_sup-',[status(thm)],[zip_derived_cl14,zip_derived_cl0]) ).
thf(zip_derived_cl5,plain,
number_of_routines @ sk_ @ sk__1 @ high,
inference(cnf,[status(esa)],[a16]) ).
thf(zip_derived_cl16,plain,
$false,
inference(demod,[status(thm)],[zip_derived_cl15,zip_derived_cl5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.ANBBQGJJ8g true
% 0.11/0.37 % Computer : n020.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 : Mon Sep 7 13:03:28 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 % Running portfolio for 300 s
% 0.11/0.37 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37 % Number of cores: 8
% 0.11/0.38 % Python version: Python 3.12.3
% 0.16/0.38 % Running in FO mode
% 0.46/0.64 % Total configuration time : 435
% 0.46/0.64 % Estimated wc time : 1092
% 0.46/0.64 % Estimated cpu time (7 cpus) : 156.0
% 0.48/0.71 % /export/starexec/sandbox2/solver/bin/fo/fo6_bce.sh running for 75s
% 0.48/0.75 % Solved by fo/fo6_bce.sh.
% 0.48/0.75 % BCE start: 8
% 0.48/0.75 % BCE eliminated: 0
% 0.48/0.75 % PE start: 8
% 0.48/0.75 logic: neq
% 0.48/0.75 % PE eliminated: 3
% 0.48/0.75 % done 5 iterations in 0.012s
% 0.48/0.75 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 0.48/0.75 % SZS output start Refutation
% See solution above
% 0.48/0.75
% 0.48/0.75
% 0.48/0.75 % Terminating...
% 0.48/0.78 % Runner terminated.
% 0.48/0.79 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------