TSTP Solution File: MGT041-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT041-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:09 EDT 2022
% Result : Unsatisfiable 1.81s 2.04s
% Output : Refutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 12 ( 6 unt; 3 nHn; 12 RR)
% Number of literals : 23 ( 0 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 8 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ number_of_routines(A,B,low)
| ~ number_of_routines(A,B,high) ),
file('MGT041-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ organisation_at_time(A,B)
| ~ efficient_producer(A)
| ~ founding_time(A,B)
| has_elaborated_routines(A,B) ),
file('MGT041-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ organisation_at_time(A,B)
| ~ first_mover(A)
| ~ founding_time(A,B)
| number_of_routines(A,B,low) ),
file('MGT041-2.p',unknown),
[] ).
cnf(4,axiom,
~ has_elaborated_routines(sk1,sk2),
file('MGT041-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ organisation_at_time(A,B)
| first_mover(A)
| efficient_producer(A) ),
file('MGT041-2.p',unknown),
[] ).
cnf(6,axiom,
organisation_at_time(sk1,sk2),
file('MGT041-2.p',unknown),
[] ).
cnf(7,axiom,
founding_time(sk1,sk2),
file('MGT041-2.p',unknown),
[] ).
cnf(8,axiom,
number_of_routines(sk1,sk2,high),
file('MGT041-2.p',unknown),
[] ).
cnf(9,plain,
( first_mover(sk1)
| efficient_producer(sk1) ),
inference(hyper,[status(thm)],[6,5]),
[iquote('hyper,6,5')] ).
cnf(10,plain,
( efficient_producer(sk1)
| number_of_routines(sk1,sk2,low) ),
inference(hyper,[status(thm)],[9,3,6,7]),
[iquote('hyper,9,3,6,7')] ).
cnf(11,plain,
number_of_routines(sk1,sk2,low),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[10,2,6,7]),4]),
[iquote('hyper,10,2,6,7,unit_del,4')] ).
cnf(12,plain,
$false,
inference(hyper,[status(thm)],[11,1,8]),
[iquote('hyper,11,1,8')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MGT041-2 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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:20:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.81/2.04 ----- Otter 3.3f, August 2004 -----
% 1.81/2.04 The process was started by sandbox2 on n023.cluster.edu,
% 1.81/2.04 Wed Jul 27 04:20:18 2022
% 1.81/2.04 The command was "./otter". The process ID is 3386.
% 1.81/2.04
% 1.81/2.04 set(prolog_style_variables).
% 1.81/2.04 set(auto).
% 1.81/2.04 dependent: set(auto1).
% 1.81/2.04 dependent: set(process_input).
% 1.81/2.04 dependent: clear(print_kept).
% 1.81/2.04 dependent: clear(print_new_demod).
% 1.81/2.04 dependent: clear(print_back_demod).
% 1.81/2.04 dependent: clear(print_back_sub).
% 1.81/2.04 dependent: set(control_memory).
% 1.81/2.04 dependent: assign(max_mem, 12000).
% 1.81/2.04 dependent: assign(pick_given_ratio, 4).
% 1.81/2.04 dependent: assign(stats_level, 1).
% 1.81/2.04 dependent: assign(max_seconds, 10800).
% 1.81/2.04 clear(print_given).
% 1.81/2.04
% 1.81/2.04 list(usable).
% 1.81/2.04 0 [] -number_of_routines(A,B,low)| -number_of_routines(A,B,high).
% 1.81/2.04 0 [] -organisation_at_time(A,B)| -efficient_producer(A)| -founding_time(A,B)|has_elaborated_routines(A,B).
% 1.81/2.04 0 [] -organisation_at_time(A,B)| -first_mover(A)| -founding_time(A,B)|number_of_routines(A,B,low).
% 1.81/2.04 0 [] organisation_at_time(sk1,sk2).
% 1.81/2.04 0 [] founding_time(sk1,sk2).
% 1.81/2.04 0 [] number_of_routines(sk1,sk2,high).
% 1.81/2.04 0 [] -has_elaborated_routines(sk1,sk2).
% 1.81/2.04 0 [] -organisation_at_time(A,B)|first_mover(A)|efficient_producer(A).
% 1.81/2.04 end_of_list.
% 1.81/2.04
% 1.81/2.04 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.81/2.04
% 1.81/2.04 This is a non-Horn set without equality. The strategy will
% 1.81/2.04 be ordered hyper_res, unit deletion, and factoring, with
% 1.81/2.04 satellites in sos and with nuclei in usable.
% 1.81/2.04
% 1.81/2.04 dependent: set(hyper_res).
% 1.81/2.04 dependent: set(factor).
% 1.81/2.04 dependent: set(unit_deletion).
% 1.81/2.04
% 1.81/2.04 ------------> process usable:
% 1.81/2.04 ** KEPT (pick-wt=8): 1 [] -number_of_routines(A,B,low)| -number_of_routines(A,B,high).
% 1.81/2.04 ** KEPT (pick-wt=11): 2 [] -organisation_at_time(A,B)| -efficient_producer(A)| -founding_time(A,B)|has_elaborated_routines(A,B).
% 1.81/2.04 ** KEPT (pick-wt=12): 3 [] -organisation_at_time(A,B)| -first_mover(A)| -founding_time(A,B)|number_of_routines(A,B,low).
% 1.81/2.04 ** KEPT (pick-wt=3): 4 [] -has_elaborated_routines(sk1,sk2).
% 1.81/2.04 ** KEPT (pick-wt=7): 5 [] -organisation_at_time(A,B)|first_mover(A)|efficient_producer(A).
% 1.81/2.04
% 1.81/2.04 ------------> process sos:
% 1.81/2.04 ** KEPT (pick-wt=3): 6 [] organisation_at_time(sk1,sk2).
% 1.81/2.04 ** KEPT (pick-wt=3): 7 [] founding_time(sk1,sk2).
% 1.81/2.04 ** KEPT (pick-wt=4): 8 [] number_of_routines(sk1,sk2,high).
% 1.81/2.04
% 1.81/2.04 ======= end of input processing =======
% 1.81/2.04
% 1.81/2.04 =========== start of search ===========
% 1.81/2.04
% 1.81/2.04 -------- PROOF --------
% 1.81/2.04
% 1.81/2.04 -----> EMPTY CLAUSE at 0.00 sec ----> 12 [hyper,11,1,8] $F.
% 1.81/2.04
% 1.81/2.04 Length of proof is 3. Level of proof is 3.
% 1.81/2.04
% 1.81/2.04 ---------------- PROOF ----------------
% 1.81/2.04 % SZS status Unsatisfiable
% 1.81/2.04 % SZS output start Refutation
% See solution above
% 1.81/2.04 ------------ end of proof -------------
% 1.81/2.04
% 1.81/2.04
% 1.81/2.04 Search stopped by max_proofs option.
% 1.81/2.04
% 1.81/2.04
% 1.81/2.04 Search stopped by max_proofs option.
% 1.81/2.04
% 1.81/2.04 ============ end of search ============
% 1.81/2.04
% 1.81/2.04 -------------- statistics -------------
% 1.81/2.04 clauses given 6
% 1.81/2.04 clauses generated 4
% 1.81/2.04 clauses kept 11
% 1.81/2.04 clauses forward subsumed 0
% 1.81/2.04 clauses back subsumed 1
% 1.81/2.04 Kbytes malloced 976
% 1.81/2.04
% 1.81/2.04 ----------- times (seconds) -----------
% 1.81/2.04 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.81/2.04 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.81/2.04 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.81/2.04
% 1.81/2.04 That finishes the proof of the theorem.
% 1.81/2.04
% 1.81/2.04 Process 3386 finished Wed Jul 27 04:20:20 2022
% 1.81/2.04 Otter interrupted
% 1.81/2.04 PROOF FOUND
%------------------------------------------------------------------------------