TSTP Solution File: MGT058-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT058-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:14 EDT 2022
% Result : Unsatisfiable 1.75s 1.97s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 31 ( 13 unt; 9 nHn; 29 RR)
% Number of literals : 52 ( 12 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ smaller(A,B)
| smaller_or_e_qual(A,B) ),
file('MGT058-1.p',unknown),
[] ).
cnf(3,axiom,
( A != B
| smaller_or_e_qual(A,B) ),
file('MGT058-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ greater_or_e_qual(A,B)
| greater(A,B)
| A = B ),
file('MGT058-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ greater(A,B)
| smaller(B,A) ),
file('MGT058-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ greater(A,B)
| ~ greater(B,A) ),
file('MGT058-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ fragile_position(A)
| ~ smaller_or_e_qual(age(A,B),sigma)
| positional_advantage(A,B) ),
file('MGT058-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ robust_position(A)
| ~ smaller_or_e_qual(age(A,B),tau)
| ~ positional_advantage(A,B) ),
file('MGT058-1.p',unknown),
[] ).
cnf(17,plain,
~ greater(A,A),
inference(factor,[status(thm)],[9]),
[iquote('factor,9.1.2')] ).
cnf(18,axiom,
A = A,
file('MGT058-1.p',unknown),
[] ).
cnf(25,axiom,
age(sk3,sk4) = zero,
file('MGT058-1.p',unknown),
[] ).
cnf(27,axiom,
greater_or_e_qual(sigma,zero),
file('MGT058-1.p',unknown),
[] ).
cnf(28,axiom,
greater_or_e_qual(tau,zero),
file('MGT058-1.p',unknown),
[] ).
cnf(29,axiom,
fragile_position(sk3),
file('MGT058-1.p',unknown),
[] ).
cnf(30,axiom,
robust_position(sk3),
file('MGT058-1.p',unknown),
[] ).
cnf(32,plain,
smaller_or_e_qual(A,A),
inference(hyper,[status(thm)],[18,3]),
[iquote('hyper,18,3')] ).
cnf(39,plain,
( greater(sigma,zero)
| zero = sigma ),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[27,4])]),
[iquote('hyper,27,4,flip.2')] ).
cnf(67,plain,
( greater(tau,zero)
| zero = tau ),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[28,4])]),
[iquote('hyper,28,4,flip.2')] ).
cnf(84,plain,
( ~ smaller_or_e_qual(zero,tau)
| ~ positional_advantage(sk3,sk4) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[25,14]),30]),
[iquote('para_from,25.1.1,14.2.1,unit_del,30')] ).
cnf(86,plain,
( ~ smaller_or_e_qual(zero,sigma)
| positional_advantage(sk3,sk4) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[25,11]),29]),
[iquote('para_from,25.1.1,11.2.1,unit_del,29')] ).
cnf(105,plain,
( zero = sigma
| smaller(zero,sigma) ),
inference(hyper,[status(thm)],[39,8]),
[iquote('hyper,39,8')] ).
cnf(116,plain,
( zero = tau
| smaller(zero,tau) ),
inference(hyper,[status(thm)],[67,8]),
[iquote('hyper,67,8')] ).
cnf(143,plain,
( ~ positional_advantage(sk3,sk4)
| greater(tau,zero) ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[84,67]),32]),
[iquote('para_into,84.1.1,67.2.1,unit_del,32')] ).
cnf(182,plain,
( positional_advantage(sk3,sk4)
| greater(sigma,zero) ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[86,39]),32]),
[iquote('para_into,86.1.1,39.2.1,unit_del,32')] ).
cnf(195,plain,
( zero = sigma
| smaller_or_e_qual(zero,sigma) ),
inference(hyper,[status(thm)],[105,2]),
[iquote('hyper,105,2')] ).
cnf(243,plain,
( zero = tau
| smaller_or_e_qual(zero,tau) ),
inference(hyper,[status(thm)],[116,2]),
[iquote('hyper,116,2')] ).
cnf(320,plain,
( zero = sigma
| positional_advantage(sk3,sk4) ),
inference(hyper,[status(thm)],[195,86]),
[iquote('hyper,195,86')] ).
cnf(474,plain,
positional_advantage(sk3,sk4),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[320,182]),17])]),
[iquote('para_from,320.1.1,182.2.2,unit_del,17,factor_simp')] ).
cnf(482,plain,
greater(tau,zero),
inference(hyper,[status(thm)],[474,143]),
[iquote('hyper,474,143')] ).
cnf(484,plain,
zero = tau,
inference(hyper,[status(thm)],[474,84,243]),
[iquote('hyper,474,84,243')] ).
cnf(485,plain,
greater(tau,tau),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[482]),484]),
[iquote('back_demod,482,demod,484')] ).
cnf(486,plain,
$false,
inference(binary,[status(thm)],[485,17]),
[iquote('binary,485.1,17.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT058-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n009.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 03:59:51 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.75/1.96 ----- Otter 3.3f, August 2004 -----
% 1.75/1.96 The process was started by sandbox2 on n009.cluster.edu,
% 1.75/1.96 Wed Jul 27 03:59:51 2022
% 1.75/1.96 The command was "./otter". The process ID is 28990.
% 1.75/1.96
% 1.75/1.96 set(prolog_style_variables).
% 1.75/1.96 set(auto).
% 1.75/1.96 dependent: set(auto1).
% 1.75/1.96 dependent: set(process_input).
% 1.75/1.96 dependent: clear(print_kept).
% 1.75/1.96 dependent: clear(print_new_demod).
% 1.75/1.96 dependent: clear(print_back_demod).
% 1.75/1.96 dependent: clear(print_back_sub).
% 1.75/1.96 dependent: set(control_memory).
% 1.75/1.96 dependent: assign(max_mem, 12000).
% 1.75/1.96 dependent: assign(pick_given_ratio, 4).
% 1.75/1.96 dependent: assign(stats_level, 1).
% 1.75/1.96 dependent: assign(max_seconds, 10800).
% 1.75/1.96 clear(print_given).
% 1.75/1.96
% 1.75/1.96 list(usable).
% 1.75/1.96 0 [] A=A.
% 1.75/1.96 0 [] -smaller_or_e_qual(A,B)|smaller(A,B)|A=B.
% 1.75/1.96 0 [] -smaller(A,B)|smaller_or_e_qual(A,B).
% 1.75/1.96 0 [] A!=B|smaller_or_e_qual(A,B).
% 1.75/1.96 0 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.75/1.96 0 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.75/1.96 0 [] A!=B|greater_or_e_qual(A,B).
% 1.75/1.96 0 [] -smaller(A,B)|greater(B,A).
% 1.75/1.96 0 [] -greater(A,B)|smaller(B,A).
% 1.75/1.96 0 [] -greater(A,B)| -greater(B,A).
% 1.75/1.96 0 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.75/1.96 0 [] smaller(A,B)|A=B|greater(A,B).
% 1.75/1.96 0 [] -fragile_position(A)| -smaller_or_e_qual(age(A,B),sigma)|positional_advantage(A,B).
% 1.75/1.96 0 [] -fragile_position(A)| -greater(age(A,B),sigma)| -positional_advantage(A,B).
% 1.75/1.96 0 [] smaller_or_e_qual(age(A,sk1(A)),sigma)|greater(age(A,sk1(A)),sigma)|fragile_position(A).
% 1.75/1.96 0 [] smaller_or_e_qual(age(A,sk1(A)),sigma)|positional_advantage(A,sk1(A))|fragile_position(A).
% 1.75/1.96 0 [] -positional_advantage(A,sk1(A))|greater(age(A,sk1(A)),sigma)|fragile_position(A).
% 1.75/1.96 0 [] -positional_advantage(A,sk1(A))|positional_advantage(A,sk1(A))|fragile_position(A).
% 1.75/1.96 0 [] -robust_position(A)| -smaller_or_e_qual(age(A,B),tau)| -positional_advantage(A,B).
% 1.75/1.96 0 [] -robust_position(A)| -greater(age(A,B),tau)|positional_advantage(A,B).
% 1.75/1.96 0 [] smaller_or_e_qual(age(A,sk2(A)),tau)|greater(age(A,sk2(A)),tau)|robust_position(A).
% 1.75/1.96 0 [] smaller_or_e_qual(age(A,sk2(A)),tau)| -positional_advantage(A,sk2(A))|robust_position(A).
% 1.75/1.96 0 [] positional_advantage(A,sk2(A))|greater(age(A,sk2(A)),tau)|robust_position(A).
% 1.75/1.96 0 [] positional_advantage(A,sk2(A))| -positional_advantage(A,sk2(A))|robust_position(A).
% 1.75/1.96 0 [] organization(sk3).
% 1.75/1.96 0 [] age(sk3,sk4)=zero.
% 1.75/1.96 0 [] greater_or_e_qual(sigma,zero).
% 1.75/1.96 0 [] greater_or_e_qual(tau,zero).
% 1.75/1.96 0 [] fragile_position(sk3).
% 1.75/1.96 0 [] robust_position(sk3).
% 1.75/1.96 end_of_list.
% 1.75/1.96
% 1.75/1.96 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.75/1.96
% 1.75/1.96 This ia a non-Horn set with equality. The strategy will be
% 1.75/1.96 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.75/1.96 deletion, with positive clauses in sos and nonpositive
% 1.75/1.96 clauses in usable.
% 1.75/1.96
% 1.75/1.96 dependent: set(knuth_bendix).
% 1.75/1.96 dependent: set(anl_eq).
% 1.75/1.96 dependent: set(para_from).
% 1.75/1.96 dependent: set(para_into).
% 1.75/1.96 dependent: clear(para_from_right).
% 1.75/1.96 dependent: clear(para_into_right).
% 1.75/1.96 dependent: set(para_from_vars).
% 1.75/1.96 dependent: set(eq_units_both_ways).
% 1.75/1.96 dependent: set(dynamic_demod_all).
% 1.75/1.96 dependent: set(dynamic_demod).
% 1.75/1.96 dependent: set(order_eq).
% 1.75/1.96 dependent: set(back_demod).
% 1.75/1.96 dependent: set(lrpo).
% 1.75/1.96 dependent: set(hyper_res).
% 1.75/1.96 dependent: set(unit_deletion).
% 1.75/1.96 dependent: set(factor).
% 1.75/1.96
% 1.75/1.96 ------------> process usable:
% 1.75/1.96 ** KEPT (pick-wt=9): 1 [] -smaller_or_e_qual(A,B)|smaller(A,B)|A=B.
% 1.75/1.96 ** KEPT (pick-wt=6): 2 [] -smaller(A,B)|smaller_or_e_qual(A,B).
% 1.75/1.96 ** KEPT (pick-wt=6): 3 [] A!=B|smaller_or_e_qual(A,B).
% 1.75/1.96 ** KEPT (pick-wt=9): 4 [] -greater_or_e_qual(A,B)|greater(A,B)|A=B.
% 1.75/1.96 ** KEPT (pick-wt=6): 5 [] -greater(A,B)|greater_or_e_qual(A,B).
% 1.75/1.96 ** KEPT (pick-wt=6): 6 [] A!=B|greater_or_e_qual(A,B).
% 1.75/1.96 ** KEPT (pick-wt=6): 7 [] -smaller(A,B)|greater(B,A).
% 1.75/1.96 ** KEPT (pick-wt=6): 8 [] -greater(A,B)|smaller(B,A).
% 1.75/1.96 ** KEPT (pick-wt=6): 9 [] -greater(A,B)| -greater(B,A).
% 1.75/1.96 ** KEPT (pick-wt=9): 10 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.75/1.96 ** KEPT (pick-wt=10): 11 [] -fragile_position(A)| -smaller_or_e_qual(age(A,B),sigma)|positional_advantage(A,B).
% 1.75/1.96 ** KEPT (pick-wt=10): 12 [] -fragile_position(A)| -greater(age(A,B),sigma)| -positional_advantage(A,B).
% 1.75/1.96 ** KEPT (pick-wt=12): 13 [] -positional_advantage(A,sk1(A))|greater(age(A,sk1(A)),sigma)|fragile_position(A).
% 1.75/1.96 ** KEPT (pick-wt=10): 14 [] -robust_position(A)| -smaller_or_e_qual(age(A,B),tau)| -positional_advantage(A,B).
% 1.75/1.97 ** KEPT (pick-wt=10): 15 [] -robust_position(A)| -greater(age(A,B),tau)|positional_advantage(A,B).
% 1.75/1.97 ** KEPT (pick-wt=12): 16 [] smaller_or_e_qual(age(A,sk2(A)),tau)| -positional_advantage(A,sk2(A))|robust_position(A).
% 1.75/1.97
% 1.75/1.97 ------------> process sos:
% 1.75/1.97 ** KEPT (pick-wt=3): 18 [] A=A.
% 1.75/1.97 ** KEPT (pick-wt=9): 19 [] smaller(A,B)|A=B|greater(A,B).
% 1.75/1.97 ** KEPT (pick-wt=14): 20 [] smaller_or_e_qual(age(A,sk1(A)),sigma)|greater(age(A,sk1(A)),sigma)|fragile_position(A).
% 1.75/1.97 ** KEPT (pick-wt=12): 21 [] smaller_or_e_qual(age(A,sk1(A)),sigma)|positional_advantage(A,sk1(A))|fragile_position(A).
% 1.75/1.97 ** KEPT (pick-wt=14): 22 [] smaller_or_e_qual(age(A,sk2(A)),tau)|greater(age(A,sk2(A)),tau)|robust_position(A).
% 1.75/1.97 ** KEPT (pick-wt=12): 23 [] positional_advantage(A,sk2(A))|greater(age(A,sk2(A)),tau)|robust_position(A).
% 1.75/1.97 ** KEPT (pick-wt=2): 24 [] organization(sk3).
% 1.75/1.97 ** KEPT (pick-wt=5): 25 [] age(sk3,sk4)=zero.
% 1.75/1.97 ---> New Demodulator: 26 [new_demod,25] age(sk3,sk4)=zero.
% 1.75/1.97 ** KEPT (pick-wt=3): 27 [] greater_or_e_qual(sigma,zero).
% 1.75/1.97 ** KEPT (pick-wt=3): 28 [] greater_or_e_qual(tau,zero).
% 1.75/1.97 ** KEPT (pick-wt=2): 29 [] fragile_position(sk3).
% 1.75/1.97 ** KEPT (pick-wt=2): 30 [] robust_position(sk3).
% 1.75/1.97 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] A=A.
% 1.75/1.97 >>>> Starting back demodulation with 26.
% 1.75/1.97
% 1.75/1.97 ======= end of input processing =======
% 1.75/1.97
% 1.75/1.97 =========== start of search ===========
% 1.75/1.97
% 1.75/1.97 -------- PROOF --------
% 1.75/1.97
% 1.75/1.97 ----> UNIT CONFLICT at 0.01 sec ----> 486 [binary,485.1,17.1] $F.
% 1.75/1.97
% 1.75/1.97 Length of proof is 17. Level of proof is 7.
% 1.75/1.97
% 1.75/1.97 ---------------- PROOF ----------------
% 1.75/1.97 % SZS status Unsatisfiable
% 1.75/1.97 % SZS output start Refutation
% See solution above
% 1.75/1.97 ------------ end of proof -------------
% 1.75/1.97
% 1.75/1.97
% 1.75/1.97 Search stopped by max_proofs option.
% 1.75/1.97
% 1.75/1.97
% 1.75/1.97 Search stopped by max_proofs option.
% 1.75/1.97
% 1.75/1.97 ============ end of search ============
% 1.75/1.97
% 1.75/1.97 -------------- statistics -------------
% 1.75/1.97 clauses given 37
% 1.75/1.97 clauses generated 636
% 1.75/1.97 clauses kept 483
% 1.75/1.97 clauses forward subsumed 182
% 1.75/1.97 clauses back subsumed 129
% 1.75/1.97 Kbytes malloced 976
% 1.75/1.97
% 1.75/1.97 ----------- times (seconds) -----------
% 1.75/1.97 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.75/1.97 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.97 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.75/1.97
% 1.75/1.97 That finishes the proof of the theorem.
% 1.75/1.97
% 1.75/1.97 Process 28990 finished Wed Jul 27 03:59:53 2022
% 1.75/1.97 Otter interrupted
% 1.75/1.97 PROOF FOUND
%------------------------------------------------------------------------------