TSTP Solution File: MGT041-2 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : MGT041-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:17:28 EDT 2022
% Result : Unsatisfiable 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 19
% Syntax : Number of formulae : 70 ( 37 unt; 10 typ; 0 def)
% Number of atoms : 316 ( 82 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 443 ( 73 ~; 92 |; 0 &; 278 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 78 ( 0 ^ 78 !; 0 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_efficient_producer,type,
efficient_producer: $i > $o ).
thf(tp_first_mover,type,
first_mover: $i > $o ).
thf(tp_founding_time,type,
founding_time: $i > $i > $o ).
thf(tp_has_elaborated_routines,type,
has_elaborated_routines: $i > $i > $o ).
thf(tp_high,type,
high: $i ).
thf(tp_low,type,
low: $i ).
thf(tp_number_of_routines,type,
number_of_routines: $i > $i > $i > $o ).
thf(tp_organisation_at_time,type,
organisation_at_time: $i > $i > $o ).
thf(tp_sk1,type,
sk1: $i ).
thf(tp_sk2,type,
sk2: $i ).
thf(1,axiom,
! [A: $i,B: $i] :
( ~ ( number_of_routines @ A @ B @ low )
| ~ ( number_of_routines @ A @ B @ high ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_not_high_and_low_1) ).
thf(2,axiom,
~ ( has_elaborated_routines @ sk1 @ sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16_7) ).
thf(3,axiom,
number_of_routines @ sk1 @ sk2 @ high,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16_6) ).
thf(4,axiom,
founding_time @ sk1 @ sk2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16_5) ).
thf(5,axiom,
organisation_at_time @ sk1 @ sk2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16_4) ).
thf(6,axiom,
! [A: $i,B: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( first_mover @ A )
| ~ ( founding_time @ A @ B )
| ( number_of_routines @ A @ B @ low ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a15_3) ).
thf(7,axiom,
! [A: $i,B: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( efficient_producer @ A )
| ~ ( founding_time @ A @ B )
| ( has_elaborated_routines @ A @ B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a14_2) ).
thf(8,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(9,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[8]) ).
thf(10,negated_conjecture,
! [A: $i,B: $i] :
( ~ ( organisation_at_time @ A @ B )
| ( first_mover @ A )
| ( efficient_producer @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t10_8) ).
thf(11,plain,
$false = $false,
inference(unfold_def,[status(thm)],[9]) ).
thf(12,plain,
( ( ! [A: $i,B: $i] :
( ~ ( number_of_routines @ A @ B @ low )
| ~ ( number_of_routines @ A @ B @ high ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(13,plain,
( ( ~ ( has_elaborated_routines @ sk1 @ sk2 ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(14,plain,
( ( number_of_routines @ sk1 @ sk2 @ high )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(15,plain,
( ( founding_time @ sk1 @ sk2 )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(16,plain,
( ( organisation_at_time @ sk1 @ sk2 )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(17,plain,
( ( ! [A: $i,B: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( first_mover @ A )
| ~ ( founding_time @ A @ B )
| ( number_of_routines @ A @ B @ low ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(18,plain,
( ( ! [A: $i,B: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( efficient_producer @ A )
| ~ ( founding_time @ A @ B )
| ( has_elaborated_routines @ A @ B ) ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(19,plain,
( ( ! [A: $i,B: $i] :
( ~ ( organisation_at_time @ A @ B )
| ( first_mover @ A )
| ( efficient_producer @ A ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(20,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[11]) ).
thf(21,plain,
( ( ! [A: $i] :
( ! [B: $i] :
~ ( organisation_at_time @ A @ B )
| ( efficient_producer @ A )
| ( first_mover @ A ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[19]) ).
thf(22,plain,
( ( ! [A: $i] :
( ! [B: $i] :
~ ( organisation_at_time @ A @ B )
| ( efficient_producer @ A )
| ( first_mover @ A ) ) )
= $true ),
inference(copy,[status(thm)],[21]) ).
thf(23,plain,
( ( ! [A: $i,B: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( efficient_producer @ A )
| ~ ( founding_time @ A @ B )
| ( has_elaborated_routines @ A @ B ) ) )
= $true ),
inference(copy,[status(thm)],[18]) ).
thf(24,plain,
( ( ! [A: $i,B: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( first_mover @ A )
| ~ ( founding_time @ A @ B )
| ( number_of_routines @ A @ B @ low ) ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(25,plain,
( ( organisation_at_time @ sk1 @ sk2 )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(26,plain,
( ( founding_time @ sk1 @ sk2 )
= $true ),
inference(copy,[status(thm)],[15]) ).
thf(27,plain,
( ( number_of_routines @ sk1 @ sk2 @ high )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(28,plain,
( ( ~ ( has_elaborated_routines @ sk1 @ sk2 ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(29,plain,
( ( ! [A: $i,B: $i] :
( ~ ( number_of_routines @ A @ B @ low )
| ~ ( number_of_routines @ A @ B @ high ) ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(30,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[20]) ).
thf(31,plain,
! [SV1: $i] :
( ( ! [SY8: $i] :
~ ( organisation_at_time @ SV1 @ SY8 )
| ( efficient_producer @ SV1 )
| ( first_mover @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(32,plain,
! [SV2: $i] :
( ( ! [SY9: $i] :
( ~ ( organisation_at_time @ SV2 @ SY9 )
| ~ ( efficient_producer @ SV2 )
| ~ ( founding_time @ SV2 @ SY9 )
| ( has_elaborated_routines @ SV2 @ SY9 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(33,plain,
! [SV3: $i] :
( ( ! [SY10: $i] :
( ~ ( organisation_at_time @ SV3 @ SY10 )
| ~ ( first_mover @ SV3 )
| ~ ( founding_time @ SV3 @ SY10 )
| ( number_of_routines @ SV3 @ SY10 @ low ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(34,plain,
( ( has_elaborated_routines @ sk1 @ sk2 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[28]) ).
thf(35,plain,
! [SV4: $i] :
( ( ! [SY11: $i] :
( ~ ( number_of_routines @ SV4 @ SY11 @ low )
| ~ ( number_of_routines @ SV4 @ SY11 @ high ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[29]) ).
thf(36,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[30]) ).
thf(37,plain,
! [SV1: $i] :
( ( ( ! [SY8: $i] :
~ ( organisation_at_time @ SV1 @ SY8 ) )
= $true )
| ( ( ( efficient_producer @ SV1 )
| ( first_mover @ SV1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[31]) ).
thf(38,plain,
! [SV5: $i,SV2: $i] :
( ( ~ ( organisation_at_time @ SV2 @ SV5 )
| ~ ( efficient_producer @ SV2 )
| ~ ( founding_time @ SV2 @ SV5 )
| ( has_elaborated_routines @ SV2 @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[32]) ).
thf(39,plain,
! [SV6: $i,SV3: $i] :
( ( ~ ( organisation_at_time @ SV3 @ SV6 )
| ~ ( first_mover @ SV3 )
| ~ ( founding_time @ SV3 @ SV6 )
| ( number_of_routines @ SV3 @ SV6 @ low ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[33]) ).
thf(40,plain,
! [SV7: $i,SV4: $i] :
( ( ~ ( number_of_routines @ SV4 @ SV7 @ low )
| ~ ( number_of_routines @ SV4 @ SV7 @ high ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[35]) ).
thf(41,plain,
! [SV8: $i,SV1: $i] :
( ( ( ~ ( organisation_at_time @ SV1 @ SV8 ) )
= $true )
| ( ( ( efficient_producer @ SV1 )
| ( first_mover @ SV1 ) )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[37]) ).
thf(42,plain,
! [SV5: $i,SV2: $i] :
( ( ( ~ ( organisation_at_time @ SV2 @ SV5 ) )
= $true )
| ( ( ~ ( efficient_producer @ SV2 )
| ~ ( founding_time @ SV2 @ SV5 )
| ( has_elaborated_routines @ SV2 @ SV5 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[38]) ).
thf(43,plain,
! [SV6: $i,SV3: $i] :
( ( ( ~ ( organisation_at_time @ SV3 @ SV6 ) )
= $true )
| ( ( ~ ( first_mover @ SV3 )
| ~ ( founding_time @ SV3 @ SV6 )
| ( number_of_routines @ SV3 @ SV6 @ low ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[39]) ).
thf(44,plain,
! [SV7: $i,SV4: $i] :
( ( ( ~ ( number_of_routines @ SV4 @ SV7 @ low ) )
= $true )
| ( ( ~ ( number_of_routines @ SV4 @ SV7 @ high ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[40]) ).
thf(45,plain,
! [SV8: $i,SV1: $i] :
( ( ( organisation_at_time @ SV1 @ SV8 )
= $false )
| ( ( ( efficient_producer @ SV1 )
| ( first_mover @ SV1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[41]) ).
thf(46,plain,
! [SV5: $i,SV2: $i] :
( ( ( organisation_at_time @ SV2 @ SV5 )
= $false )
| ( ( ~ ( efficient_producer @ SV2 )
| ~ ( founding_time @ SV2 @ SV5 )
| ( has_elaborated_routines @ SV2 @ SV5 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[42]) ).
thf(47,plain,
! [SV6: $i,SV3: $i] :
( ( ( organisation_at_time @ SV3 @ SV6 )
= $false )
| ( ( ~ ( first_mover @ SV3 )
| ~ ( founding_time @ SV3 @ SV6 )
| ( number_of_routines @ SV3 @ SV6 @ low ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[43]) ).
thf(48,plain,
! [SV7: $i,SV4: $i] :
( ( ( number_of_routines @ SV4 @ SV7 @ low )
= $false )
| ( ( ~ ( number_of_routines @ SV4 @ SV7 @ high ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[44]) ).
thf(49,plain,
! [SV8: $i,SV1: $i] :
( ( ( efficient_producer @ SV1 )
= $true )
| ( ( first_mover @ SV1 )
= $true )
| ( ( organisation_at_time @ SV1 @ SV8 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[45]) ).
thf(50,plain,
! [SV5: $i,SV2: $i] :
( ( ( ~ ( efficient_producer @ SV2 ) )
= $true )
| ( ( ~ ( founding_time @ SV2 @ SV5 )
| ( has_elaborated_routines @ SV2 @ SV5 ) )
= $true )
| ( ( organisation_at_time @ SV2 @ SV5 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[46]) ).
thf(51,plain,
! [SV6: $i,SV3: $i] :
( ( ( ~ ( first_mover @ SV3 ) )
= $true )
| ( ( ~ ( founding_time @ SV3 @ SV6 )
| ( number_of_routines @ SV3 @ SV6 @ low ) )
= $true )
| ( ( organisation_at_time @ SV3 @ SV6 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[47]) ).
thf(52,plain,
! [SV7: $i,SV4: $i] :
( ( ( number_of_routines @ SV4 @ SV7 @ high )
= $false )
| ( ( number_of_routines @ SV4 @ SV7 @ low )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[48]) ).
thf(53,plain,
! [SV5: $i,SV2: $i] :
( ( ( efficient_producer @ SV2 )
= $false )
| ( ( ~ ( founding_time @ SV2 @ SV5 )
| ( has_elaborated_routines @ SV2 @ SV5 ) )
= $true )
| ( ( organisation_at_time @ SV2 @ SV5 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[50]) ).
thf(54,plain,
! [SV6: $i,SV3: $i] :
( ( ( first_mover @ SV3 )
= $false )
| ( ( ~ ( founding_time @ SV3 @ SV6 )
| ( number_of_routines @ SV3 @ SV6 @ low ) )
= $true )
| ( ( organisation_at_time @ SV3 @ SV6 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[51]) ).
thf(55,plain,
! [SV5: $i,SV2: $i] :
( ( ( ~ ( founding_time @ SV2 @ SV5 ) )
= $true )
| ( ( has_elaborated_routines @ SV2 @ SV5 )
= $true )
| ( ( efficient_producer @ SV2 )
= $false )
| ( ( organisation_at_time @ SV2 @ SV5 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[53]) ).
thf(56,plain,
! [SV6: $i,SV3: $i] :
( ( ( ~ ( founding_time @ SV3 @ SV6 ) )
= $true )
| ( ( number_of_routines @ SV3 @ SV6 @ low )
= $true )
| ( ( first_mover @ SV3 )
= $false )
| ( ( organisation_at_time @ SV3 @ SV6 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[54]) ).
thf(57,plain,
! [SV5: $i,SV2: $i] :
( ( ( founding_time @ SV2 @ SV5 )
= $false )
| ( ( has_elaborated_routines @ SV2 @ SV5 )
= $true )
| ( ( efficient_producer @ SV2 )
= $false )
| ( ( organisation_at_time @ SV2 @ SV5 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[55]) ).
thf(58,plain,
! [SV6: $i,SV3: $i] :
( ( ( founding_time @ SV3 @ SV6 )
= $false )
| ( ( number_of_routines @ SV3 @ SV6 @ low )
= $true )
| ( ( first_mover @ SV3 )
= $false )
| ( ( organisation_at_time @ SV3 @ SV6 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[56]) ).
thf(59,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[25,58,57,52,49,36,34,27,26]) ).
thf(60,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : MGT041-2 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 07:39:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 8
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/0.34 (rf:0,axioms:8,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:10,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.12/0.38
% 0.12/0.38 ********************************
% 0.12/0.38 * All subproblems solved! *
% 0.12/0.38 ********************************
% 0.12/0.38 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:8,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:59,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.38
% 0.12/0.38 %**** Beginning of derivation protocol ****
% 0.12/0.38 % SZS output start CNFRefutation
% See solution above
% 0.12/0.38
% 0.12/0.38 %**** End of derivation protocol ****
% 0.12/0.38 %**** no. of clauses in derivation: 60 ****
% 0.12/0.38 %**** clause counter: 59 ****
% 0.12/0.38
% 0.12/0.38 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:8,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:59,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------