TSTP Solution File: SYN093-1.002 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN093-1.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:23:33 EDT 2022
% Result : Unsatisfiable 1.64s 1.85s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 6 unt; 7 nHn; 21 RR)
% Number of literals : 40 ( 0 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 8 ( 7 usr; 8 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( u_1
| ~ p_1_2 ),
file('SYN093-1.002.p',unknown),
[] ).
cnf(2,plain,
( ~ p_1_2
| u_1 ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,propositional')] ).
cnf(3,axiom,
~ u_1,
file('SYN093-1.002.p',unknown),
[] ).
cnf(4,axiom,
( u_2
| p_1_2
| ~ p_2_2
| ~ p_1_1 ),
file('SYN093-1.002.p',unknown),
[] ).
cnf(5,plain,
( ~ p_2_2
| ~ p_1_1
| p_1_2
| u_2 ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[4])]),
[iquote('copy,4,propositional')] ).
cnf(6,axiom,
( p_1_2
| ~ u_2 ),
file('SYN093-1.002.p',unknown),
[] ).
cnf(7,plain,
( ~ u_2
| p_1_2 ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[6])]),
[iquote('copy,6,propositional')] ).
cnf(36,axiom,
( p_1_1
| ~ u_10 ),
file('SYN093-1.002.p',unknown),
[] ).
cnf(37,plain,
( ~ u_10
| p_1_1 ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[36])]),
[iquote('copy,36,propositional')] ).
cnf(40,axiom,
( p_2_2
| ~ u_12 ),
file('SYN093-1.002.p',unknown),
[] ).
cnf(41,plain,
( ~ u_12
| p_2_2 ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[40])]),
[iquote('copy,40,propositional')] ).
cnf(44,axiom,
( u_10
| p_1_1 ),
file('SYN093-1.002.p',unknown),
[] ).
cnf(45,plain,
( p_1_1
| u_10 ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[44])]),
[iquote('copy,44,propositional')] ).
cnf(48,axiom,
( u_12
| p_2_2 ),
file('SYN093-1.002.p',unknown),
[] ).
cnf(49,plain,
( p_2_2
| u_12 ),
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[48])]),
[iquote('copy,48,propositional')] ).
cnf(52,plain,
p_1_1,
inference(hyper,[status(thm)],[45,37]),
[iquote('hyper,45,37')] ).
cnf(54,plain,
p_2_2,
inference(hyper,[status(thm)],[49,41]),
[iquote('hyper,49,41')] ).
cnf(57,plain,
( p_1_2
| u_2 ),
inference(hyper,[status(thm)],[54,5,52]),
[iquote('hyper,54,5,52')] ).
cnf(61,plain,
p_1_2,
inference(hyper,[status(thm)],[57,7]),
[iquote('hyper,57,7')] ).
cnf(62,plain,
u_1,
inference(hyper,[status(thm)],[61,2]),
[iquote('hyper,61,2')] ).
cnf(63,plain,
$false,
inference(binary,[status(thm)],[62,3]),
[iquote('binary,62.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN093-1.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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 11:01:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.64/1.85 ----- Otter 3.3f, August 2004 -----
% 1.64/1.85 The process was started by sandbox on n012.cluster.edu,
% 1.64/1.85 Wed Jul 27 11:01:05 2022
% 1.64/1.85 The command was "./otter". The process ID is 28617.
% 1.64/1.85
% 1.64/1.85 set(prolog_style_variables).
% 1.64/1.85 set(auto).
% 1.64/1.85 dependent: set(auto1).
% 1.64/1.85 dependent: set(process_input).
% 1.64/1.85 dependent: clear(print_kept).
% 1.64/1.85 dependent: clear(print_new_demod).
% 1.64/1.85 dependent: clear(print_back_demod).
% 1.64/1.85 dependent: clear(print_back_sub).
% 1.64/1.85 dependent: set(control_memory).
% 1.64/1.85 dependent: assign(max_mem, 12000).
% 1.64/1.85 dependent: assign(pick_given_ratio, 4).
% 1.64/1.85 dependent: assign(stats_level, 1).
% 1.64/1.85 dependent: assign(max_seconds, 10800).
% 1.64/1.85 clear(print_given).
% 1.64/1.85
% 1.64/1.85 list(usable).
% 1.64/1.85 0 [] u_1| -p_1_2.
% 1.64/1.85 0 [] -u_1.
% 1.64/1.85 0 [] u_2|p_1_2| -p_2_2| -p_1_1.
% 1.64/1.85 0 [] p_1_2| -u_2.
% 1.64/1.85 0 [] u_3|p_1_2| -q_2_2| -q_1_1.
% 1.64/1.85 0 [] p_1_2| -u_3.
% 1.64/1.85 0 [] u_4|q_1_2| -p_2_2| -q_1_1.
% 1.64/1.85 0 [] q_1_2| -u_4.
% 1.64/1.85 0 [] u_5|q_1_2| -q_2_2| -p_1_1.
% 1.64/1.85 0 [] q_1_2| -u_5.
% 1.64/1.85 0 [] u_6|p_1_1| -p_1_2.
% 1.64/1.85 0 [] p_1_1| -u_6.
% 1.64/1.85 0 [] u_7|q_1_1| -q_1_2.
% 1.64/1.85 0 [] q_1_1| -u_7.
% 1.64/1.85 0 [] u_8|p_2_2| -p_1_2.
% 1.64/1.85 0 [] p_2_2| -u_8.
% 1.64/1.85 0 [] u_9|q_2_2| -q_1_2.
% 1.64/1.85 0 [] q_2_2| -u_9.
% 1.64/1.85 0 [] u_10|p_1_1.
% 1.64/1.85 0 [] p_1_1| -u_10.
% 1.64/1.85 0 [] u_11|q_1_1.
% 1.64/1.85 0 [] q_1_1| -u_11.
% 1.64/1.85 0 [] u_12|p_2_2.
% 1.64/1.85 0 [] p_2_2| -u_12.
% 1.64/1.85 0 [] u_13|q_2_2.
% 1.64/1.85 0 [] q_2_2| -u_13.
% 1.64/1.85 end_of_list.
% 1.64/1.85
% 1.64/1.85 SCAN INPUT: prop=1, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.64/1.85
% 1.64/1.85 The clause set is propositional; the strategy will be
% 1.64/1.85 ordered hyperresolution with the propositional
% 1.64/1.85 optimizations, with satellites in sos and nuclei in usable.
% 1.64/1.85
% 1.64/1.85 dependent: set(hyper_res).
% 1.64/1.85 dependent: set(propositional).
% 1.64/1.85 dependent: set(sort_literals).
% 1.64/1.85
% 1.64/1.85 ------------> process usable:
% 1.64/1.85 ** KEPT (pick-wt=2): 2 [copy,1,propositional] -p_1_2|u_1.
% 1.64/1.85 ** KEPT (pick-wt=1): 3 [] -u_1.
% 1.64/1.85 ** KEPT (pick-wt=4): 5 [copy,4,propositional] -p_2_2| -p_1_1|p_1_2|u_2.
% 1.64/1.85 ** KEPT (pick-wt=2): 7 [copy,6,propositional] -u_2|p_1_2.
% 1.64/1.85 ** KEPT (pick-wt=4): 9 [copy,8,propositional] -q_2_2| -q_1_1|p_1_2|u_3.
% 1.64/1.85 ** KEPT (pick-wt=2): 11 [copy,10,propositional] -u_3|p_1_2.
% 1.64/1.85 ** KEPT (pick-wt=4): 13 [copy,12,propositional] -p_2_2| -q_1_1|u_4|q_1_2.
% 1.64/1.85 ** KEPT (pick-wt=2): 15 [copy,14,propositional] -u_4|q_1_2.
% 1.64/1.85 ** KEPT (pick-wt=4): 17 [copy,16,propositional] -p_1_1| -q_2_2|q_1_2|u_5.
% 1.64/1.85 ** KEPT (pick-wt=2): 19 [copy,18,propositional] -u_5|q_1_2.
% 1.64/1.85 ** KEPT (pick-wt=3): 21 [copy,20,propositional] -p_1_2|p_1_1|u_6.
% 1.64/1.85 ** KEPT (pick-wt=2): 23 [copy,22,propositional] -u_6|p_1_1.
% 1.64/1.85 ** KEPT (pick-wt=3): 25 [copy,24,propositional] -q_1_2|q_1_1|u_7.
% 1.64/1.85 ** KEPT (pick-wt=2): 27 [copy,26,propositional] -u_7|q_1_1.
% 1.64/1.85 ** KEPT (pick-wt=3): 29 [copy,28,propositional] -p_1_2|p_2_2|u_8.
% 1.64/1.85 ** KEPT (pick-wt=2): 31 [copy,30,propositional] -u_8|p_2_2.
% 1.64/1.85 ** KEPT (pick-wt=3): 33 [copy,32,propositional] -q_1_2|q_2_2|u_9.
% 1.64/1.85 ** KEPT (pick-wt=2): 35 [copy,34,propositional] -u_9|q_2_2.
% 1.64/1.85 ** KEPT (pick-wt=2): 37 [copy,36,propositional] -u_10|p_1_1.
% 1.64/1.85 ** KEPT (pick-wt=2): 39 [copy,38,propositional] -u_11|q_1_1.
% 1.64/1.85 ** KEPT (pick-wt=2): 41 [copy,40,propositional] -u_12|p_2_2.
% 1.64/1.85 ** KEPT (pick-wt=2): 43 [copy,42,propositional] -u_13|q_2_2.
% 1.64/1.85
% 1.64/1.85 ------------> process sos:
% 1.64/1.85 ** KEPT (pick-wt=2): 45 [copy,44,propositional] p_1_1|u_10.
% 1.64/1.85 ** KEPT (pick-wt=2): 47 [copy,46,propositional] q_1_1|u_11.
% 1.64/1.85 ** KEPT (pick-wt=2): 49 [copy,48,propositional] p_2_2|u_12.
% 1.64/1.85 ** KEPT (pick-wt=2): 51 [copy,50,propositional] q_2_2|u_13.
% 1.64/1.85
% 1.64/1.85 ======= end of input processing =======
% 1.64/1.85
% 1.64/1.85 =========== start of search ===========
% 1.64/1.85
% 1.64/1.85 -------- PROOF --------
% 1.64/1.85
% 1.64/1.85 ----> UNIT CONFLICT at 0.00 sec ----> 63 [binary,62.1,3.1] $F.
% 1.64/1.85
% 1.64/1.85 Length of proof is 12. Level of proof is 5.
% 1.64/1.85
% 1.64/1.85 ---------------- PROOF ----------------
% 1.64/1.85 % SZS status Unsatisfiable
% 1.64/1.85 % SZS output start Refutation
% See solution above
% 1.64/1.85 ------------ end of proof -------------
% 1.64/1.85
% 1.64/1.85
% 1.64/1.85 Search stopped by max_proofs option.
% 1.64/1.85
% 1.64/1.85
% 1.64/1.85 Search stopped by max_proofs option.
% 1.64/1.85
% 1.64/1.85 ============ end of search ============
% 1.64/1.85
% 1.64/1.85 -------------- statistics -------------
% 1.64/1.85 clauses given 12
% 1.64/1.85 clauses generated 11
% 1.64/1.85 clauses kept 37
% 1.64/1.85 clauses forward subsumed 0
% 1.64/1.85 clauses back subsumed 28
% 1.64/1.85 Kbytes malloced 976
% 1.64/1.85
% 1.64/1.85 ----------- times (seconds) -----------
% 1.64/1.85 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.85 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.85 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.64/1.85
% 1.64/1.85 That finishes the proof of the theorem.
% 1.64/1.85
% 1.64/1.85 Process 28617 finished Wed Jul 27 11:01:07 2022
% 1.64/1.85 Otter interrupted
% 1.64/1.85 PROOF FOUND
%------------------------------------------------------------------------------