TSTP Solution File: MGT045-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT045-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:10 EDT 2022
% Result : Unsatisfiable 1.97s 2.14s
% Output : Refutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 8 RR)
% Number of literals : 12 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(11,axiom,
( ~ organization(A)
| ~ greater(external_ties(A,B),external_ties(A,C))
| greater(position(A,B),position(A,C)) ),
file('MGT045-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ organization(A)
| ~ greater(age(A,B),age(A,C))
| greater(external_ties(A,B),external_ties(A,C)) ),
file('MGT045-1.p',unknown),
[] ).
cnf(14,axiom,
~ greater(position(sk1,sk3),position(sk1,sk2)),
file('MGT045-1.p',unknown),
[] ).
cnf(18,axiom,
organization(sk1),
file('MGT045-1.p',unknown),
[] ).
cnf(19,axiom,
greater(age(sk1,sk3),age(sk1,sk2)),
file('MGT045-1.p',unknown),
[] ).
cnf(24,plain,
greater(external_ties(sk1,sk3),external_ties(sk1,sk2)),
inference(hyper,[status(thm)],[19,13,18]),
[iquote('hyper,19,13,18')] ).
cnf(64,plain,
greater(position(sk1,sk3),position(sk1,sk2)),
inference(hyper,[status(thm)],[24,11,18]),
[iquote('hyper,24,11,18')] ).
cnf(65,plain,
$false,
inference(binary,[status(thm)],[64,14]),
[iquote('binary,64.1,14.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : MGT045-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:10:30 EDT 2022
% 0.19/0.33 % CPUTime :
% 1.97/2.14 ----- Otter 3.3f, August 2004 -----
% 1.97/2.14 The process was started by sandbox on n025.cluster.edu,
% 1.97/2.14 Wed Jul 27 04:10:30 2022
% 1.97/2.14 The command was "./otter". The process ID is 28758.
% 1.97/2.14
% 1.97/2.14 set(prolog_style_variables).
% 1.97/2.14 set(auto).
% 1.97/2.14 dependent: set(auto1).
% 1.97/2.14 dependent: set(process_input).
% 1.97/2.14 dependent: clear(print_kept).
% 1.97/2.14 dependent: clear(print_new_demod).
% 1.97/2.14 dependent: clear(print_back_demod).
% 1.97/2.14 dependent: clear(print_back_sub).
% 1.97/2.14 dependent: set(control_memory).
% 1.97/2.14 dependent: assign(max_mem, 12000).
% 1.97/2.14 dependent: assign(pick_given_ratio, 4).
% 1.97/2.14 dependent: assign(stats_level, 1).
% 1.97/2.14 dependent: assign(max_seconds, 10800).
% 1.97/2.14 clear(print_given).
% 1.97/2.14
% 1.97/2.14 list(usable).
% 1.97/2.14 0 [] A=A.
% 1.97/2.14 0 [] -smaller_or_e_qual(A,B)|smaller(A,B)|A=B.
% 1.97/2.14 0 [] -smaller(A,B)|smaller_or_e_qual(A,B).
% 1.97/2.14 0 [] A!=B|smaller_or_e_qual(A,B).
% 1.97/2.14 0 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.97/2.14 0 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.97/2.14 0 [] A!=B|greater_or_e_qual(A,B).
% 1.97/2.14 0 [] -smaller(A,B)|greater(B,A).
% 1.97/2.14 0 [] -greater(A,B)|smaller(B,A).
% 1.97/2.14 0 [] -greater(A,B)| -greater(B,A).
% 1.97/2.14 0 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.97/2.14 0 [] smaller(A,B)|A=B|greater(A,B).
% 1.97/2.14 0 [] -organization(A)| -greater(external_ties(A,B),external_ties(A,C))|greater(position(A,B),position(A,C)).
% 1.97/2.14 0 [] -organization(A)|external_ties(A,B)!=external_ties(A,C)|position(A,B)=position(A,C).
% 1.97/2.14 0 [] -organization(A)| -greater(age(A,B),age(A,C))|greater(external_ties(A,B),external_ties(A,C)).
% 1.97/2.14 0 [] organization(sk1).
% 1.97/2.14 0 [] greater(age(sk1,sk3),age(sk1,sk2)).
% 1.97/2.14 0 [] -greater(position(sk1,sk3),position(sk1,sk2)).
% 1.97/2.14 end_of_list.
% 1.97/2.14
% 1.97/2.14 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.97/2.14
% 1.97/2.14 This ia a non-Horn set with equality. The strategy will be
% 1.97/2.14 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.97/2.14 deletion, with positive clauses in sos and nonpositive
% 1.97/2.14 clauses in usable.
% 1.97/2.14
% 1.97/2.14 dependent: set(knuth_bendix).
% 1.97/2.14 dependent: set(anl_eq).
% 1.97/2.14 dependent: set(para_from).
% 1.97/2.14 dependent: set(para_into).
% 1.97/2.14 dependent: clear(para_from_right).
% 1.97/2.14 dependent: clear(para_into_right).
% 1.97/2.14 dependent: set(para_from_vars).
% 1.97/2.14 dependent: set(eq_units_both_ways).
% 1.97/2.14 dependent: set(dynamic_demod_all).
% 1.97/2.14 dependent: set(dynamic_demod).
% 1.97/2.14 dependent: set(order_eq).
% 1.97/2.14 dependent: set(back_demod).
% 1.97/2.14 dependent: set(lrpo).
% 1.97/2.14 dependent: set(hyper_res).
% 1.97/2.14 dependent: set(unit_deletion).
% 1.97/2.14 dependent: set(factor).
% 1.97/2.14
% 1.97/2.14 ------------> process usable:
% 1.97/2.14 ** KEPT (pick-wt=9): 1 [] -smaller_or_e_qual(A,B)|smaller(A,B)|A=B.
% 1.97/2.14 ** KEPT (pick-wt=6): 2 [] -smaller(A,B)|smaller_or_e_qual(A,B).
% 1.97/2.14 ** KEPT (pick-wt=6): 3 [] A!=B|smaller_or_e_qual(A,B).
% 1.97/2.14 ** KEPT (pick-wt=9): 4 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.97/2.14 ** KEPT (pick-wt=6): 5 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.97/2.14 ** KEPT (pick-wt=6): 6 [] A!=B|greater_or_e_qual(A,B).
% 1.97/2.14 ** KEPT (pick-wt=6): 7 [] -smaller(A,B)|greater(B,A).
% 1.97/2.14 ** KEPT (pick-wt=6): 8 [] -greater(A,B)|smaller(B,A).
% 1.97/2.14 ** KEPT (pick-wt=6): 9 [] -greater(A,B)| -greater(B,A).
% 1.97/2.14 ** KEPT (pick-wt=9): 10 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.97/2.14 ** KEPT (pick-wt=16): 11 [] -organization(A)| -greater(external_ties(A,B),external_ties(A,C))|greater(position(A,B),position(A,C)).
% 1.97/2.14 ** KEPT (pick-wt=16): 12 [] -organization(A)|external_ties(A,B)!=external_ties(A,C)|position(A,B)=position(A,C).
% 1.97/2.14 ** KEPT (pick-wt=16): 13 [] -organization(A)| -greater(age(A,B),age(A,C))|greater(external_ties(A,B),external_ties(A,C)).
% 1.97/2.14 ** KEPT (pick-wt=7): 14 [] -greater(position(sk1,sk3),position(sk1,sk2)).
% 1.97/2.14
% 1.97/2.14 ------------> process sos:
% 1.97/2.14 ** KEPT (pick-wt=3): 16 [] A=A.
% 1.97/2.14 ** KEPT (pick-wt=9): 17 [] smaller(A,B)|A=B|greater(A,B).
% 1.97/2.14 ** KEPT (pick-wt=2): 18 [] organization(sk1).
% 1.97/2.14 ** KEPT (pick-wt=7): 19 [] greater(age(sk1,sk3),age(sk1,sk2)).
% 1.97/2.14 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] A=A.
% 1.97/2.14
% 1.97/2.14 ======= end of input processing =======
% 1.97/2.14
% 1.97/2.14 =========== start of search ===========
% 1.97/2.14
% 1.97/2.14 -------- PROOF --------
% 1.97/2.14
% 1.97/2.14 ----> UNIT CONFLICT at 0.00 sec ----> 65 [binary,64.1,14.1] $F.
% 1.97/2.14
% 1.97/2.14 Length of proof is 2. Level of proof is 2.
% 1.97/2.14
% 1.97/2.14 ---------------- PROOF ----------------
% 1.97/2.14 % SZS status Unsatisfiable
% 1.97/2.14 % SZS output start Refutation
% See solution above
% 1.97/2.14 ------------ end of proof -------------
% 1.97/2.14
% 1.97/2.14
% 1.97/2.14 Search stopped by max_proofs option.
% 1.97/2.14
% 1.97/2.14
% 1.97/2.14 Search stopped by max_proofs option.
% 1.97/2.14
% 1.97/2.14 ============ end of search ============
% 1.97/2.14
% 1.97/2.14 -------------- statistics -------------
% 1.97/2.14 clauses given 7
% 1.97/2.14 clauses generated 55
% 1.97/2.14 clauses kept 64
% 1.97/2.14 clauses forward subsumed 10
% 1.97/2.14 clauses back subsumed 0
% 1.97/2.14 Kbytes malloced 976
% 1.97/2.14
% 1.97/2.14 ----------- times (seconds) -----------
% 1.97/2.14 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.14 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.14 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.97/2.14
% 1.97/2.14 That finishes the proof of the theorem.
% 1.97/2.14
% 1.97/2.14 Process 28758 finished Wed Jul 27 04:10:32 2022
% 1.97/2.14 Otter interrupted
% 1.97/2.14 PROOF FOUND
%------------------------------------------------------------------------------