TSTP Solution File: MGT039-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT039-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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 : 300s
% DateTime : Wed Jul 27 13:06:08 EDT 2022
% Result : Unsatisfiable 1.68s 1.87s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of clauses : 41 ( 21 unt; 10 nHn; 39 RR)
% Number of literals : 85 ( 9 equ; 35 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ observational_period(A)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| environment(sk1(A))
| selection_favors(efficient_producers,first_movers,A) ),
file('MGT039-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ observational_period(A)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| in_environment(A,sk1(A))
| selection_favors(efficient_producers,first_movers,A) ),
file('MGT039-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ observational_period(A)
| ~ propagation_strategy(first_movers)
| ~ propagation_strategy(efficient_producers)
| ~ selection_favors(efficient_producers,first_movers,end_time(sk1(A)))
| selection_favors(efficient_producers,first_movers,A) ),
file('MGT039-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ observational_period(A)
| ~ slow_change(A)
| ~ environment(B)
| ~ in_environment(A,B)
| in_environment(B,sk2(B,A)) ),
file('MGT039-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ observational_period(A)
| ~ slow_change(A)
| ~ environment(B)
| ~ in_environment(A,B)
| greater(sk2(B,A),critical_point(B)) ),
file('MGT039-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ environment(A)
| ~ greater_or_e_qual(B,start_time(A))
| ~ greater_or_e_qual(end_time(A),B)
| in_environment(A,B) ),
file('MGT039-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ environment(A)
| ~ in_environment(A,B)
| greater_or_e_qual(end_time(A),B) ),
file('MGT039-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ environment(A)
| greater_or_e_qual(critical_point(A),start_time(A)) ),
file('MGT039-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ greater(A,B)
| ~ greater(B,C)
| greater(A,C) ),
file('MGT039-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ greater_or_e_qual(A,B)
| greater(A,B)
| A = B ),
file('MGT039-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ greater(A,B)
| greater_or_e_qual(A,B) ),
file('MGT039-1.p',unknown),
[] ).
cnf(12,axiom,
( A != B
| greater_or_e_qual(A,B) ),
file('MGT039-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ environment(A)
| ~ in_environment(A,B)
| ~ greater(B,critical_point(A))
| selection_favors(efficient_producers,first_movers,B) ),
file('MGT039-1.p',unknown),
[] ).
cnf(15,axiom,
~ selection_favors(efficient_producers,first_movers,sk3),
file('MGT039-1.p',unknown),
[] ).
cnf(16,axiom,
A = A,
file('MGT039-1.p',unknown),
[] ).
cnf(17,axiom,
propagation_strategy(first_movers),
file('MGT039-1.p',unknown),
[] ).
cnf(18,axiom,
propagation_strategy(efficient_producers),
file('MGT039-1.p',unknown),
[] ).
cnf(19,axiom,
observational_period(sk3),
file('MGT039-1.p',unknown),
[] ).
cnf(20,axiom,
slow_change(sk3),
file('MGT039-1.p',unknown),
[] ).
cnf(21,plain,
greater_or_e_qual(A,A),
inference(hyper,[status(thm)],[16,12]),
[iquote('hyper,16,12')] ).
cnf(24,plain,
in_environment(sk3,sk1(sk3)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[19,2,17,18]),15]),
[iquote('hyper,19,2,17,18,unit_del,15')] ).
cnf(25,plain,
environment(sk1(sk3)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[19,1,17,18]),15]),
[iquote('hyper,19,1,17,18,unit_del,15')] ).
cnf(28,plain,
greater_or_e_qual(critical_point(sk1(sk3)),start_time(sk1(sk3))),
inference(hyper,[status(thm)],[25,8]),
[iquote('hyper,25,8')] ).
cnf(31,plain,
greater(sk2(sk1(sk3),sk3),critical_point(sk1(sk3))),
inference(hyper,[status(thm)],[24,5,19,20,25]),
[iquote('hyper,24,5,19,20,25')] ).
cnf(32,plain,
in_environment(sk1(sk3),sk2(sk1(sk3),sk3)),
inference(hyper,[status(thm)],[24,4,19,20,25]),
[iquote('hyper,24,4,19,20,25')] ).
cnf(36,plain,
( greater(critical_point(sk1(sk3)),start_time(sk1(sk3)))
| start_time(sk1(sk3)) = critical_point(sk1(sk3)) ),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[28,10])]),
[iquote('hyper,28,10,flip.2')] ).
cnf(43,plain,
greater_or_e_qual(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)),
inference(hyper,[status(thm)],[32,7,25]),
[iquote('hyper,32,7,25')] ).
cnf(58,plain,
selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)),
inference(hyper,[status(thm)],[31,14,25,32]),
[iquote('hyper,31,14,25,32')] ).
cnf(76,plain,
( greater(end_time(sk1(sk3)),sk2(sk1(sk3),sk3))
| end_time(sk1(sk3)) = sk2(sk1(sk3),sk3) ),
inference(hyper,[status(thm)],[43,10]),
[iquote('hyper,43,10')] ).
cnf(119,plain,
( start_time(sk1(sk3)) = critical_point(sk1(sk3))
| greater(sk2(sk1(sk3),sk3),start_time(sk1(sk3))) ),
inference(hyper,[status(thm)],[36,9,31]),
[iquote('hyper,36,9,31')] ).
cnf(640,plain,
greater(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[76,3]),19,17,18,58,15]),
[iquote('para_from,76.2.1,3.4.3,unit_del,19,17,18,58,15')] ).
cnf(641,plain,
( greater(end_time(sk1(sk3)),start_time(sk1(sk3)))
| start_time(sk1(sk3)) = critical_point(sk1(sk3)) ),
inference(hyper,[status(thm)],[640,9,119]),
[iquote('hyper,640,9,119')] ).
cnf(642,plain,
greater(end_time(sk1(sk3)),critical_point(sk1(sk3))),
inference(hyper,[status(thm)],[640,9,31]),
[iquote('hyper,640,9,31')] ).
cnf(650,plain,
greater_or_e_qual(end_time(sk1(sk3)),critical_point(sk1(sk3))),
inference(hyper,[status(thm)],[642,11]),
[iquote('hyper,642,11')] ).
cnf(776,plain,
( start_time(sk1(sk3)) = critical_point(sk1(sk3))
| greater_or_e_qual(end_time(sk1(sk3)),start_time(sk1(sk3))) ),
inference(hyper,[status(thm)],[641,11]),
[iquote('hyper,641,11')] ).
cnf(908,plain,
( start_time(sk1(sk3)) = critical_point(sk1(sk3))
| in_environment(sk1(sk3),end_time(sk1(sk3))) ),
inference(hyper,[status(thm)],[776,6,25,21]),
[iquote('hyper,776,6,25,21')] ).
cnf(958,plain,
( ~ greater_or_e_qual(A,critical_point(sk1(sk3)))
| ~ greater_or_e_qual(end_time(sk1(sk3)),A)
| in_environment(sk1(sk3),A)
| in_environment(sk1(sk3),end_time(sk1(sk3))) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[908,6]),25]),
[iquote('para_from,908.1.1,6.2.2,unit_del,25')] ).
cnf(959,plain,
in_environment(sk1(sk3),end_time(sk1(sk3))),
inference(unit_del,[status(thm)],[inference(factor,[status(thm)],[958]),650,21]),
[iquote('factor,958.3.4,unit_del,650,21')] ).
cnf(960,plain,
selection_favors(efficient_producers,first_movers,end_time(sk1(sk3))),
inference(hyper,[status(thm)],[959,14,25,642]),
[iquote('hyper,959,14,25,642')] ).
cnf(972,plain,
selection_favors(efficient_producers,first_movers,sk3),
inference(hyper,[status(thm)],[960,3,19,17,18]),
[iquote('hyper,960,3,19,17,18')] ).
cnf(973,plain,
$false,
inference(binary,[status(thm)],[972,15]),
[iquote('binary,972.1,15.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT039-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 04:00:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.48/1.69 ----- Otter 3.3f, August 2004 -----
% 1.48/1.69 The process was started by sandbox2 on n012.cluster.edu,
% 1.48/1.69 Wed Jul 27 04:00:20 2022
% 1.48/1.69 The command was "./otter". The process ID is 23990.
% 1.48/1.69
% 1.48/1.69 set(prolog_style_variables).
% 1.48/1.69 set(auto).
% 1.48/1.69 dependent: set(auto1).
% 1.48/1.69 dependent: set(process_input).
% 1.48/1.69 dependent: clear(print_kept).
% 1.48/1.69 dependent: clear(print_new_demod).
% 1.48/1.69 dependent: clear(print_back_demod).
% 1.48/1.69 dependent: clear(print_back_sub).
% 1.48/1.69 dependent: set(control_memory).
% 1.48/1.69 dependent: assign(max_mem, 12000).
% 1.48/1.69 dependent: assign(pick_given_ratio, 4).
% 1.48/1.69 dependent: assign(stats_level, 1).
% 1.48/1.69 dependent: assign(max_seconds, 10800).
% 1.48/1.69 clear(print_given).
% 1.48/1.69
% 1.48/1.69 list(usable).
% 1.48/1.69 0 [] A=A.
% 1.48/1.69 0 [] -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)|environment(sk1(A))|selection_favors(efficient_producers,first_movers,A).
% 1.48/1.69 0 [] -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)|in_environment(A,sk1(A))|selection_favors(efficient_producers,first_movers,A).
% 1.48/1.69 0 [] -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)| -selection_favors(efficient_producers,first_movers,end_time(sk1(A)))|selection_favors(efficient_producers,first_movers,A).
% 1.48/1.69 0 [] -observational_period(A)| -slow_change(A)| -environment(B)| -in_environment(A,B)|in_environment(B,sk2(B,A)).
% 1.48/1.69 0 [] -observational_period(A)| -slow_change(A)| -environment(B)| -in_environment(A,B)|greater(sk2(B,A),critical_point(B)).
% 1.48/1.69 0 [] propagation_strategy(first_movers).
% 1.48/1.69 0 [] propagation_strategy(efficient_producers).
% 1.48/1.69 0 [] -environment(A)| -greater_or_e_qual(B,start_time(A))| -greater_or_e_qual(end_time(A),B)|in_environment(A,B).
% 1.48/1.69 0 [] -environment(A)| -in_environment(A,B)|greater_or_e_qual(end_time(A),B).
% 1.48/1.69 0 [] -environment(A)|greater_or_e_qual(critical_point(A),start_time(A)).
% 1.48/1.69 0 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.48/1.69 0 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.48/1.69 0 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.48/1.69 0 [] A!=B|greater_or_e_qual(A,B).
% 1.48/1.69 0 [] -environment(A)| -greater(B,start_time(A))|greater(B,end_time(A))|greater_or_e_qual(end_time(A),B).
% 1.48/1.69 0 [] -environment(A)| -in_environment(A,B)| -greater(B,critical_point(A))|selection_favors(efficient_producers,first_movers,B).
% 1.48/1.69 0 [] observational_period(sk3).
% 1.48/1.69 0 [] slow_change(sk3).
% 1.48/1.69 0 [] -selection_favors(efficient_producers,first_movers,sk3).
% 1.48/1.69 end_of_list.
% 1.48/1.69
% 1.48/1.69 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.48/1.69
% 1.48/1.69 This ia a non-Horn set with equality. The strategy will be
% 1.48/1.69 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.48/1.69 deletion, with positive clauses in sos and nonpositive
% 1.48/1.69 clauses in usable.
% 1.48/1.69
% 1.48/1.69 dependent: set(knuth_bendix).
% 1.48/1.69 dependent: set(anl_eq).
% 1.48/1.69 dependent: set(para_from).
% 1.48/1.69 dependent: set(para_into).
% 1.48/1.69 dependent: clear(para_from_right).
% 1.48/1.69 dependent: clear(para_into_right).
% 1.48/1.69 dependent: set(para_from_vars).
% 1.48/1.69 dependent: set(eq_units_both_ways).
% 1.48/1.69 dependent: set(dynamic_demod_all).
% 1.48/1.69 dependent: set(dynamic_demod).
% 1.48/1.69 dependent: set(order_eq).
% 1.48/1.69 dependent: set(back_demod).
% 1.48/1.69 dependent: set(lrpo).
% 1.48/1.69 dependent: set(hyper_res).
% 1.48/1.69 dependent: set(unit_deletion).
% 1.48/1.69 dependent: set(factor).
% 1.48/1.69
% 1.48/1.69 ------------> process usable:
% 1.48/1.69 ** KEPT (pick-wt=13): 1 [] -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)|environment(sk1(A))|selection_favors(efficient_producers,first_movers,A).
% 1.48/1.69 ** KEPT (pick-wt=14): 2 [] -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)|in_environment(A,sk1(A))|selection_favors(efficient_producers,first_movers,A).
% 1.48/1.69 ** KEPT (pick-wt=16): 3 [] -observational_period(A)| -propagation_strategy(first_movers)| -propagation_strategy(efficient_producers)| -selection_favors(efficient_producers,first_movers,end_time(sk1(A)))|selection_favors(efficient_producers,first_movers,A).
% 1.48/1.69 ** KEPT (pick-wt=14): 4 [] -observational_period(A)| -slow_change(A)| -environment(B)| -in_environment(A,B)|in_environment(B,sk2(B,A)).
% 1.48/1.69 ** KEPT (pick-wt=15): 5 [] -observational_period(A)| -slow_change(A)| -environment(B)| -in_environment(A,B)|greater(sk2(B,A),critical_point(B)).
% 1.68/1.87 ** KEPT (pick-wt=13): 6 [] -environment(A)| -greater_or_e_qual(B,start_time(A))| -greater_or_e_qual(end_time(A),B)|in_environment(A,B).
% 1.68/1.87 ** KEPT (pick-wt=9): 7 [] -environment(A)| -in_environment(A,B)|greater_or_e_qual(end_time(A),B).
% 1.68/1.87 ** KEPT (pick-wt=7): 8 [] -environment(A)|greater_or_e_qual(critical_point(A),start_time(A)).
% 1.68/1.87 ** KEPT (pick-wt=9): 9 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.68/1.87 ** KEPT (pick-wt=9): 10 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.68/1.87 ** KEPT (pick-wt=6): 11 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.68/1.87 ** KEPT (pick-wt=6): 12 [] A!=B|greater_or_e_qual(A,B).
% 1.68/1.87 ** KEPT (pick-wt=14): 13 [] -environment(A)| -greater(B,start_time(A))|greater(B,end_time(A))|greater_or_e_qual(end_time(A),B).
% 1.68/1.87 ** KEPT (pick-wt=13): 14 [] -environment(A)| -in_environment(A,B)| -greater(B,critical_point(A))|selection_favors(efficient_producers,first_movers,B).
% 1.68/1.87 ** KEPT (pick-wt=4): 15 [] -selection_favors(efficient_producers,first_movers,sk3).
% 1.68/1.87
% 1.68/1.87 ------------> process sos:
% 1.68/1.87 ** KEPT (pick-wt=3): 16 [] A=A.
% 1.68/1.87 ** KEPT (pick-wt=2): 17 [] propagation_strategy(first_movers).
% 1.68/1.87 ** KEPT (pick-wt=2): 18 [] propagation_strategy(efficient_producers).
% 1.68/1.87 ** KEPT (pick-wt=2): 19 [] observational_period(sk3).
% 1.68/1.87 ** KEPT (pick-wt=2): 20 [] slow_change(sk3).
% 1.68/1.87 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] A=A.
% 1.68/1.87
% 1.68/1.87 ======= end of input processing =======
% 1.68/1.87
% 1.68/1.87 =========== start of search ===========
% 1.68/1.87
% 1.68/1.87 -------- PROOF --------
% 1.68/1.87
% 1.68/1.87 ----> UNIT CONFLICT at 0.18 sec ----> 973 [binary,972.1,15.1] $F.
% 1.68/1.87
% 1.68/1.87 Length of proof is 21. Level of proof is 12.
% 1.68/1.87
% 1.68/1.87 ---------------- PROOF ----------------
% 1.68/1.87 % SZS status Unsatisfiable
% 1.68/1.87 % SZS output start Refutation
% See solution above
% 1.68/1.87 ------------ end of proof -------------
% 1.68/1.87
% 1.68/1.87
% 1.68/1.87 Search stopped by max_proofs option.
% 1.68/1.87
% 1.68/1.87
% 1.68/1.87 Search stopped by max_proofs option.
% 1.68/1.87
% 1.68/1.87 ============ end of search ============
% 1.68/1.87
% 1.68/1.87 -------------- statistics -------------
% 1.68/1.87 clauses given 142
% 1.68/1.87 clauses generated 2054
% 1.68/1.87 clauses kept 972
% 1.68/1.87 clauses forward subsumed 1096
% 1.68/1.87 clauses back subsumed 44
% 1.68/1.87 Kbytes malloced 1953
% 1.68/1.87
% 1.68/1.87 ----------- times (seconds) -----------
% 1.68/1.87 user CPU time 0.18 (0 hr, 0 min, 0 sec)
% 1.68/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.87 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.68/1.87
% 1.68/1.87 That finishes the proof of the theorem.
% 1.68/1.87
% 1.68/1.87 Process 23990 finished Wed Jul 27 04:00:22 2022
% 1.68/1.87 Otter interrupted
% 1.68/1.87 PROOF FOUND
%------------------------------------------------------------------------------