TSTP Solution File: SYN088-1.010 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN088-1.010 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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.66s 1.88s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 12
% Syntax : Number of clauses : 14 ( 13 unt; 0 nHn; 14 RR)
% Number of literals : 24 ( 0 equ; 11 neg)
% Maximal clause size : 11 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-10 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ p(a,a,a,a,a,a,a,a,a,a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(2,axiom,
( p(A,B,C,D,E,F,G,H,I,J)
| ~ q_1(A)
| ~ q_2(B)
| ~ q_3(C)
| ~ q_4(D)
| ~ q_5(E)
| ~ q_6(F)
| ~ q_7(G)
| ~ q_8(H)
| ~ q_9(I)
| ~ q_10(J) ),
file('SYN088-1.010.p',unknown),
[] ).
cnf(3,axiom,
q_1(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(5,axiom,
q_2(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(7,axiom,
q_3(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(9,axiom,
q_4(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(11,axiom,
q_5(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(13,axiom,
q_6(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(15,axiom,
q_7(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(17,axiom,
q_8(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(19,axiom,
q_9(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(21,axiom,
q_10(a),
file('SYN088-1.010.p',unknown),
[] ).
cnf(534,plain,
p(a,a,a,a,a,a,a,a,a,a),
inference(hyper,[status(thm)],[21,2,3,5,7,9,11,13,15,17,19]),
[iquote('hyper,21,2,3,5,7,9,11,13,15,17,19')] ).
cnf(535,plain,
$false,
inference(binary,[status(thm)],[534,1]),
[iquote('binary,534.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN088-1.010 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n028.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:33:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.66/1.88 ----- Otter 3.3f, August 2004 -----
% 1.66/1.88 The process was started by sandbox2 on n028.cluster.edu,
% 1.66/1.88 Wed Jul 27 11:33:49 2022
% 1.66/1.88 The command was "./otter". The process ID is 20129.
% 1.66/1.88
% 1.66/1.88 set(prolog_style_variables).
% 1.66/1.88 set(auto).
% 1.66/1.88 dependent: set(auto1).
% 1.66/1.88 dependent: set(process_input).
% 1.66/1.88 dependent: clear(print_kept).
% 1.66/1.88 dependent: clear(print_new_demod).
% 1.66/1.88 dependent: clear(print_back_demod).
% 1.66/1.88 dependent: clear(print_back_sub).
% 1.66/1.88 dependent: set(control_memory).
% 1.66/1.88 dependent: assign(max_mem, 12000).
% 1.66/1.88 dependent: assign(pick_given_ratio, 4).
% 1.66/1.88 dependent: assign(stats_level, 1).
% 1.66/1.88 dependent: assign(max_seconds, 10800).
% 1.66/1.88 clear(print_given).
% 1.66/1.88
% 1.66/1.88 list(usable).
% 1.66/1.88 0 [] -p(a,a,a,a,a,a,a,a,a,a).
% 1.66/1.88 0 [] p(X_1,X_2,X_3,X_4,X_5,X_6,X_7,X_8,X_9,X_10)| -q_1(X_1)| -q_2(X_2)| -q_3(X_3)| -q_4(X_4)| -q_5(X_5)| -q_6(X_6)| -q_7(X_7)| -q_8(X_8)| -q_9(X_9)| -q_10(X_10).
% 1.66/1.88 0 [] q_1(a).
% 1.66/1.88 0 [] q_1(b).
% 1.66/1.88 0 [] q_2(a).
% 1.66/1.88 0 [] q_2(b).
% 1.66/1.88 0 [] q_3(a).
% 1.66/1.88 0 [] q_3(b).
% 1.66/1.88 0 [] q_4(a).
% 1.66/1.88 0 [] q_4(b).
% 1.66/1.88 0 [] q_5(a).
% 1.66/1.88 0 [] q_5(b).
% 1.66/1.88 0 [] q_6(a).
% 1.66/1.88 0 [] q_6(b).
% 1.66/1.88 0 [] q_7(a).
% 1.66/1.88 0 [] q_7(b).
% 1.66/1.88 0 [] q_8(a).
% 1.66/1.88 0 [] q_8(b).
% 1.66/1.88 0 [] q_9(a).
% 1.66/1.88 0 [] q_9(b).
% 1.66/1.88 0 [] q_10(a).
% 1.66/1.88 0 [] q_10(b).
% 1.66/1.88 end_of_list.
% 1.66/1.88
% 1.66/1.88 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=11.
% 1.66/1.88
% 1.66/1.88 This is a Horn set without equality. The strategy will
% 1.66/1.88 be hyperresolution, with satellites in sos and nuclei
% 1.66/1.88 in usable.
% 1.66/1.88
% 1.66/1.88 dependent: set(hyper_res).
% 1.66/1.88 dependent: clear(order_hyper).
% 1.66/1.88
% 1.66/1.88 ------------> process usable:
% 1.66/1.88 ** KEPT (pick-wt=11): 1 [] -p(a,a,a,a,a,a,a,a,a,a).
% 1.66/1.88 ** KEPT (pick-wt=31): 2 [] p(A,B,C,D,E,F,G,H,I,J)| -q_1(A)| -q_2(B)| -q_3(C)| -q_4(D)| -q_5(E)| -q_6(F)| -q_7(G)| -q_8(H)| -q_9(I)| -q_10(J).
% 1.66/1.88
% 1.66/1.88 ------------> process sos:
% 1.66/1.88 ** KEPT (pick-wt=2): 3 [] q_1(a).
% 1.66/1.88 ** KEPT (pick-wt=2): 4 [] q_1(b).
% 1.66/1.88 ** KEPT (pick-wt=2): 5 [] q_2(a).
% 1.66/1.88 ** KEPT (pick-wt=2): 6 [] q_2(b).
% 1.66/1.88 ** KEPT (pick-wt=2): 7 [] q_3(a).
% 1.66/1.88 ** KEPT (pick-wt=2): 8 [] q_3(b).
% 1.66/1.88 ** KEPT (pick-wt=2): 9 [] q_4(a).
% 1.66/1.88 ** KEPT (pick-wt=2): 10 [] q_4(b).
% 1.66/1.88 ** KEPT (pick-wt=2): 11 [] q_5(a).
% 1.66/1.88 ** KEPT (pick-wt=2): 12 [] q_5(b).
% 1.66/1.88 ** KEPT (pick-wt=2): 13 [] q_6(a).
% 1.66/1.88 ** KEPT (pick-wt=2): 14 [] q_6(b).
% 1.66/1.88 ** KEPT (pick-wt=2): 15 [] q_7(a).
% 1.66/1.88 ** KEPT (pick-wt=2): 16 [] q_7(b).
% 1.66/1.88 ** KEPT (pick-wt=2): 17 [] q_8(a).
% 1.66/1.88 ** KEPT (pick-wt=2): 18 [] q_8(b).
% 1.66/1.88 ** KEPT (pick-wt=2): 19 [] q_9(a).
% 1.66/1.88 ** KEPT (pick-wt=2): 20 [] q_9(b).
% 1.66/1.88 ** KEPT (pick-wt=2): 21 [] q_10(a).
% 1.66/1.88 ** KEPT (pick-wt=2): 22 [] q_10(b).
% 1.66/1.88
% 1.66/1.88 ======= end of input processing =======
% 1.66/1.88
% 1.66/1.88 =========== start of search ===========
% 1.66/1.88
% 1.66/1.88 -------- PROOF --------
% 1.66/1.88
% 1.66/1.88 ----> UNIT CONFLICT at 0.01 sec ----> 535 [binary,534.1,1.1] $F.
% 1.66/1.88
% 1.66/1.88 Length of proof is 1. Level of proof is 1.
% 1.66/1.88
% 1.66/1.88 ---------------- PROOF ----------------
% 1.66/1.88 % SZS status Unsatisfiable
% 1.66/1.88 % SZS output start Refutation
% See solution above
% 1.66/1.88 ------------ end of proof -------------
% 1.66/1.88
% 1.66/1.88
% 1.66/1.88 Search stopped by max_proofs option.
% 1.66/1.88
% 1.66/1.88
% 1.66/1.88 Search stopped by max_proofs option.
% 1.66/1.88
% 1.66/1.88 ============ end of search ============
% 1.66/1.88
% 1.66/1.88 -------------- statistics -------------
% 1.66/1.88 clauses given 19
% 1.66/1.88 clauses generated 512
% 1.66/1.88 clauses kept 534
% 1.66/1.88 clauses forward subsumed 0
% 1.66/1.88 clauses back subsumed 0
% 1.66/1.88 Kbytes malloced 976
% 1.66/1.88
% 1.66/1.88 ----------- times (seconds) -----------
% 1.66/1.88 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.66/1.88 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.88 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.66/1.88
% 1.66/1.88 That finishes the proof of the theorem.
% 1.66/1.88
% 1.66/1.88 Process 20129 finished Wed Jul 27 11:33:50 2022
% 1.66/1.88 Otter interrupted
% 1.66/1.88 PROOF FOUND
%------------------------------------------------------------------------------