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