TSTP Solution File: MGT013-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT013-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:05:59 EDT 2022
% Result : Unsatisfiable 1.68s 1.89s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of clauses : 29 ( 19 unt; 3 nHn; 28 RR)
% Number of literals : 60 ( 10 equ; 30 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 30 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ greater(A,B)
| ~ greater(B,A) ),
file('MGT013-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ organization(A,B)
| time(B) ),
file('MGT013-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ time(A)
| ~ time(B)
| greater(A,B)
| A = B
| greater(B,A) ),
file('MGT013-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ reorganization_free(A,B,C)
| reorganization_free(A,C,B) ),
file('MGT013-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ complexity(A,D,B)
| ~ complexity(A,E,C)
| B != C
| D = E ),
file('MGT013-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ reorganization_free(A,B,C)
| ~ size(A,D,B)
| ~ size(A,E,C)
| ~ greater(C,B)
| ~ greater(D,E) ),
file('MGT013-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ reorganization_free(A,B,C)
| ~ complexity(A,D,B)
| ~ complexity(A,E,C)
| ~ greater(C,B)
| ~ greater(D,E) ),
file('MGT013-1.p',unknown),
[] ).
cnf(9,plain,
~ greater(A,A),
inference(factor,[status(thm)],[2]),
[iquote('factor,2.1.2')] ).
cnf(11,plain,
( ~ organization(A,B)
| ~ complexity(A,C,B)
| ~ complexity(A,D,B)
| B != B
| C = D ),
inference(factor,[status(thm)],[6]),
[iquote('factor,6.1.2')] ).
cnf(15,axiom,
A = A,
file('MGT013-1.p',unknown),
[] ).
cnf(16,axiom,
organization(sk1,sk6),
file('MGT013-1.p',unknown),
[] ).
cnf(17,axiom,
organization(sk1,sk7),
file('MGT013-1.p',unknown),
[] ).
cnf(18,axiom,
reorganization_free(sk1,sk6,sk7),
file('MGT013-1.p',unknown),
[] ).
cnf(19,axiom,
complexity(sk1,sk2,sk6),
file('MGT013-1.p',unknown),
[] ).
cnf(20,axiom,
complexity(sk1,sk3,sk7),
file('MGT013-1.p',unknown),
[] ).
cnf(21,axiom,
size(sk1,sk4,sk6),
file('MGT013-1.p',unknown),
[] ).
cnf(22,axiom,
size(sk1,sk5,sk7),
file('MGT013-1.p',unknown),
[] ).
cnf(23,axiom,
greater(sk3,sk2),
file('MGT013-1.p',unknown),
[] ).
cnf(24,axiom,
greater(sk4,sk5),
file('MGT013-1.p',unknown),
[] ).
cnf(25,plain,
time(sk6),
inference(hyper,[status(thm)],[16,3]),
[iquote('hyper,16,3')] ).
cnf(34,plain,
time(sk7),
inference(hyper,[status(thm)],[17,3]),
[iquote('hyper,17,3')] ).
cnf(41,plain,
( greater(sk6,sk7)
| sk7 = sk6
| greater(sk7,sk6) ),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[34,4,25])]),
[iquote('hyper,34,4,25,flip.2')] ).
cnf(44,plain,
reorganization_free(sk1,sk7,sk6),
inference(hyper,[status(thm)],[18,5]),
[iquote('hyper,18,5')] ).
cnf(111,plain,
( sk7 = sk6
| greater(sk7,sk6) ),
inference(hyper,[status(thm)],[41,8,17,16,44,20,19,23]),
[iquote('hyper,41,8,17,16,44,20,19,23')] ).
cnf(114,plain,
sk7 = sk6,
inference(hyper,[status(thm)],[111,7,16,17,18,21,22,24]),
[iquote('hyper,111,7,16,17,18,21,22,24')] ).
cnf(144,plain,
complexity(sk1,sk3,sk6),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[20]),114]),
[iquote('back_demod,20,demod,114')] ).
cnf(165,plain,
sk3 = sk2,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[144,11,16,19,15])]),
[iquote('hyper,144,11,16,19,15,flip.1')] ).
cnf(171,plain,
greater(sk2,sk2),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[23]),165]),
[iquote('back_demod,23,demod,165')] ).
cnf(172,plain,
$false,
inference(binary,[status(thm)],[171,9]),
[iquote('binary,171.1,9.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : MGT013-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Wed Jul 27 03:54:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.68/1.88 ----- Otter 3.3f, August 2004 -----
% 1.68/1.88 The process was started by sandbox on n010.cluster.edu,
% 1.68/1.88 Wed Jul 27 03:54:25 2022
% 1.68/1.88 The command was "./otter". The process ID is 22021.
% 1.68/1.88
% 1.68/1.88 set(prolog_style_variables).
% 1.68/1.88 set(auto).
% 1.68/1.88 dependent: set(auto1).
% 1.68/1.88 dependent: set(process_input).
% 1.68/1.88 dependent: clear(print_kept).
% 1.68/1.88 dependent: clear(print_new_demod).
% 1.68/1.88 dependent: clear(print_back_demod).
% 1.68/1.88 dependent: clear(print_back_sub).
% 1.68/1.88 dependent: set(control_memory).
% 1.68/1.88 dependent: assign(max_mem, 12000).
% 1.68/1.88 dependent: assign(pick_given_ratio, 4).
% 1.68/1.88 dependent: assign(stats_level, 1).
% 1.68/1.88 dependent: assign(max_seconds, 10800).
% 1.68/1.88 clear(print_given).
% 1.68/1.88
% 1.68/1.88 list(usable).
% 1.68/1.88 0 [] A=A.
% 1.68/1.88 0 [] -greater(A,B)|A!=B.
% 1.68/1.88 0 [] -greater(A,B)| -greater(B,A).
% 1.68/1.88 0 [] -organization(A,B)|time(B).
% 1.68/1.88 0 [] -time(A)| -time(B)|greater(A,B)|A=B|greater(B,A).
% 1.68/1.88 0 [] -reorganization_free(A,B,C)|reorganization_free(A,C,B).
% 1.68/1.88 0 [] -organization(A,B)| -organization(A,C)| -complexity(A,D,B)| -complexity(A,E,C)|B!=C|D=E.
% 1.68/1.88 0 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -size(A,D,B)| -size(A,E,C)| -greater(C,B)| -greater(D,E).
% 1.68/1.88 0 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -complexity(A,D,B)| -complexity(A,E,C)| -greater(C,B)| -greater(D,E).
% 1.68/1.88 0 [] organization(sk1,sk6).
% 1.68/1.88 0 [] organization(sk1,sk7).
% 1.68/1.88 0 [] reorganization_free(sk1,sk6,sk7).
% 1.68/1.88 0 [] complexity(sk1,sk2,sk6).
% 1.68/1.88 0 [] complexity(sk1,sk3,sk7).
% 1.68/1.88 0 [] size(sk1,sk4,sk6).
% 1.68/1.88 0 [] size(sk1,sk5,sk7).
% 1.68/1.88 0 [] greater(sk3,sk2).
% 1.68/1.88 0 [] greater(sk4,sk5).
% 1.68/1.88 end_of_list.
% 1.68/1.88
% 1.68/1.88 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.68/1.88
% 1.68/1.88 This ia a non-Horn set with equality. The strategy will be
% 1.68/1.88 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.68/1.88 deletion, with positive clauses in sos and nonpositive
% 1.68/1.88 clauses in usable.
% 1.68/1.88
% 1.68/1.88 dependent: set(knuth_bendix).
% 1.68/1.88 dependent: set(anl_eq).
% 1.68/1.88 dependent: set(para_from).
% 1.68/1.88 dependent: set(para_into).
% 1.68/1.88 dependent: clear(para_from_right).
% 1.68/1.88 dependent: clear(para_into_right).
% 1.68/1.88 dependent: set(para_from_vars).
% 1.68/1.88 dependent: set(eq_units_both_ways).
% 1.68/1.88 dependent: set(dynamic_demod_all).
% 1.68/1.89 dependent: set(dynamic_demod).
% 1.68/1.89 dependent: set(order_eq).
% 1.68/1.89 dependent: set(back_demod).
% 1.68/1.89 dependent: set(lrpo).
% 1.68/1.89 dependent: set(hyper_res).
% 1.68/1.89 dependent: set(unit_deletion).
% 1.68/1.89 dependent: set(factor).
% 1.68/1.89
% 1.68/1.89 ------------> process usable:
% 1.68/1.89 ** KEPT (pick-wt=6): 1 [] -greater(A,B)|A!=B.
% 1.68/1.89 ** KEPT (pick-wt=6): 2 [] -greater(A,B)| -greater(B,A).
% 1.68/1.89 ** KEPT (pick-wt=5): 3 [] -organization(A,B)|time(B).
% 1.68/1.89 ** KEPT (pick-wt=13): 4 [] -time(A)| -time(B)|greater(A,B)|A=B|greater(B,A).
% 1.68/1.89 ** KEPT (pick-wt=8): 5 [] -reorganization_free(A,B,C)|reorganization_free(A,C,B).
% 1.68/1.89 ** KEPT (pick-wt=20): 6 [] -organization(A,B)| -organization(A,C)| -complexity(A,D,B)| -complexity(A,E,C)|B!=C|D=E.
% 1.68/1.89 ** KEPT (pick-wt=24): 7 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -size(A,D,B)| -size(A,E,C)| -greater(C,B)| -greater(D,E).
% 1.68/1.89 ** KEPT (pick-wt=24): 8 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -complexity(A,D,B)| -complexity(A,E,C)| -greater(C,B)| -greater(D,E).
% 1.68/1.89
% 1.68/1.89 ------------> process sos:
% 1.68/1.89 ** KEPT (pick-wt=3): 15 [] A=A.
% 1.68/1.89 ** KEPT (pick-wt=3): 16 [] organization(sk1,sk6).
% 1.68/1.89 ** KEPT (pick-wt=3): 17 [] organization(sk1,sk7).
% 1.68/1.89 ** KEPT (pick-wt=4): 18 [] reorganization_free(sk1,sk6,sk7).
% 1.68/1.89 ** KEPT (pick-wt=4): 19 [] complexity(sk1,sk2,sk6).
% 1.68/1.89 ** KEPT (pick-wt=4): 20 [] complexity(sk1,sk3,sk7).
% 1.68/1.89 ** KEPT (pick-wt=4): 21 [] size(sk1,sk4,sk6).
% 1.68/1.89 ** KEPT (pick-wt=4): 22 [] size(sk1,sk5,sk7).
% 1.68/1.89 ** KEPT (pick-wt=3): 23 [] greater(sk3,sk2).
% 1.68/1.89 ** KEPT (pick-wt=3): 24 [] greater(sk4,sk5).
% 1.68/1.89 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] A=A.
% 1.68/1.89 15 back subsumes 12.
% 1.68/1.89 15 back subsumes 10.
% 1.68/1.89
% 1.68/1.89 ======= end of input processing =======
% 1.68/1.89
% 1.68/1.89 =========== start of search ===========
% 1.68/1.89
% 1.68/1.89 -------- PROOF --------
% 1.68/1.89
% 1.68/1.89 ----> UNIT CONFLICT at 0.01 sec ----> 172 [binary,171.1,9.1] $F.
% 1.68/1.89
% 1.68/1.89 Length of proof is 11. Level of proof is 7.
% 1.68/1.89
% 1.68/1.89 ---------------- PROOF ----------------
% 1.68/1.89 % SZS status Unsatisfiable
% 1.68/1.89 % SZS output start Refutation
% See solution above
% 1.68/1.89 ------------ end of proof -------------
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Search stopped by max_proofs option.
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Search stopped by max_proofs option.
% 1.68/1.89
% 1.68/1.89 ============ end of search ============
% 1.68/1.89
% 1.68/1.89 -------------- statistics -------------
% 1.68/1.89 clauses given 20
% 1.68/1.89 clauses generated 401
% 1.68/1.89 clauses kept 169
% 1.68/1.89 clauses forward subsumed 318
% 1.68/1.89 clauses back subsumed 3
% 1.68/1.89 Kbytes malloced 976
% 1.68/1.89
% 1.68/1.89 ----------- times (seconds) -----------
% 1.68/1.89 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.68/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.89 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.68/1.89
% 1.68/1.89 That finishes the proof of the theorem.
% 1.68/1.89
% 1.68/1.89 Process 22021 finished Wed Jul 27 03:54:26 2022
% 1.68/1.89 Otter interrupted
% 1.68/1.89 PROOF FOUND
%------------------------------------------------------------------------------