TSTP Solution File: SYN558-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN558-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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:24:54 EDT 2022
% Result : Unsatisfiable 1.69s 1.90s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 15 ( 11 unt; 0 nHn; 11 RR)
% Number of literals : 26 ( 0 equ; 12 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 18 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ p5(c7,c8,A)
| ~ p5(c7,c9,A) ),
file('SYN558-1.p',unknown),
[] ).
cnf(5,axiom,
( p5(A,B,C)
| ~ p5(A,B,D)
| ~ p5(A,D,C) ),
file('SYN558-1.p',unknown),
[] ).
cnf(7,axiom,
( p2(A,B)
| ~ p6(c7,B)
| ~ p6(c7,A)
| ~ p5(c7,C,B)
| ~ p5(c7,C,A) ),
file('SYN558-1.p',unknown),
[] ).
cnf(8,axiom,
( p5(A,B,C)
| ~ p2(D,B)
| ~ p2(E,C)
| ~ p4(F,A)
| ~ p5(F,D,E) ),
file('SYN558-1.p',unknown),
[] ).
cnf(9,axiom,
p2(A,A),
file('SYN558-1.p',unknown),
[] ).
cnf(10,axiom,
p4(A,A),
file('SYN558-1.p',unknown),
[] ).
cnf(11,axiom,
p6(c7,f3(A)),
file('SYN558-1.p',unknown),
[] ).
cnf(12,axiom,
p5(c7,c10,c9),
file('SYN558-1.p',unknown),
[] ).
cnf(13,axiom,
p5(c7,c10,c8),
file('SYN558-1.p',unknown),
[] ).
cnf(14,axiom,
p5(c7,A,f3(A)),
file('SYN558-1.p',unknown),
[] ).
cnf(16,plain,
p5(c7,c10,f3(c8)),
inference(hyper,[status(thm)],[14,5,13]),
[iquote('hyper,14,5,13')] ).
cnf(17,plain,
p5(c7,c10,f3(c9)),
inference(hyper,[status(thm)],[14,5,12]),
[iquote('hyper,14,5,12')] ).
cnf(21,plain,
p2(f3(c9),f3(c8)),
inference(hyper,[status(thm)],[17,7,11,11,16]),
[iquote('hyper,17,7,11,11,16')] ).
cnf(43,plain,
p5(c7,c9,f3(c8)),
inference(hyper,[status(thm)],[21,8,9,10,14]),
[iquote('hyper,21,8,9,10,14')] ).
cnf(69,plain,
$false,
inference(hyper,[status(thm)],[43,2,14]),
[iquote('hyper,43,2,14')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN558-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 10:56:41 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.69/1.90 ----- Otter 3.3f, August 2004 -----
% 1.69/1.90 The process was started by sandbox2 on n003.cluster.edu,
% 1.69/1.90 Wed Jul 27 10:56:41 2022
% 1.69/1.90 The command was "./otter". The process ID is 14106.
% 1.69/1.90
% 1.69/1.90 set(prolog_style_variables).
% 1.69/1.90 set(auto).
% 1.69/1.90 dependent: set(auto1).
% 1.69/1.90 dependent: set(process_input).
% 1.69/1.90 dependent: clear(print_kept).
% 1.69/1.90 dependent: clear(print_new_demod).
% 1.69/1.90 dependent: clear(print_back_demod).
% 1.69/1.90 dependent: clear(print_back_sub).
% 1.69/1.90 dependent: set(control_memory).
% 1.69/1.90 dependent: assign(max_mem, 12000).
% 1.69/1.90 dependent: assign(pick_given_ratio, 4).
% 1.69/1.90 dependent: assign(stats_level, 1).
% 1.69/1.90 dependent: assign(max_seconds, 10800).
% 1.69/1.90 clear(print_given).
% 1.69/1.90
% 1.69/1.90 list(usable).
% 1.69/1.90 0 [] p2(X0,X0).
% 1.69/1.90 0 [] p4(X8,X8).
% 1.69/1.90 0 [] p6(c7,f3(X21)).
% 1.69/1.90 0 [] p5(c7,c10,c9).
% 1.69/1.90 0 [] p5(c7,c10,c8).
% 1.69/1.90 0 [] p5(c7,X21,f3(X21)).
% 1.69/1.90 0 [] p2(f3(X6),f3(X7))| -p2(X6,X7).
% 1.69/1.90 0 [] -p5(c7,c8,X26)| -p5(c7,c9,X26).
% 1.69/1.90 0 [] p2(X1,X2)| -p2(X0,X1)| -p2(X0,X2).
% 1.69/1.90 0 [] p4(X9,X10)| -p4(X8,X9)| -p4(X8,X10).
% 1.69/1.90 0 [] p5(X11,X12,X13)| -p5(X11,X12,X14)| -p5(X11,X14,X13).
% 1.69/1.90 0 [] p6(X22,X23)| -p4(X25,X22)| -p6(X25,X24)| -p2(X24,X23).
% 1.69/1.90 0 [] p2(X3,X4)| -p6(c7,X4)| -p6(c7,X3)| -p5(c7,X5,X4)| -p5(c7,X5,X3).
% 1.69/1.90 0 [] p5(X15,X16,X17)| -p2(X18,X16)| -p2(X19,X17)| -p4(X20,X15)| -p5(X20,X18,X19).
% 1.69/1.90 end_of_list.
% 1.69/1.90
% 1.69/1.90 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=5.
% 1.69/1.90
% 1.69/1.90 This is a Horn set without equality. The strategy will
% 1.69/1.90 be hyperresolution, with satellites in sos and nuclei
% 1.69/1.90 in usable.
% 1.69/1.90
% 1.69/1.90 dependent: set(hyper_res).
% 1.69/1.90 dependent: clear(order_hyper).
% 1.69/1.90
% 1.69/1.90 ------------> process usable:
% 1.69/1.90 ** KEPT (pick-wt=8): 1 [] p2(f3(A),f3(B))| -p2(A,B).
% 1.69/1.90 ** KEPT (pick-wt=8): 2 [] -p5(c7,c8,A)| -p5(c7,c9,A).
% 1.69/1.90 ** KEPT (pick-wt=9): 3 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 1.69/1.90 ** KEPT (pick-wt=9): 4 [] p4(A,B)| -p4(C,A)| -p4(C,B).
% 1.69/1.90 ** KEPT (pick-wt=12): 5 [] p5(A,B,C)| -p5(A,B,D)| -p5(A,D,C).
% 1.69/1.90 ** KEPT (pick-wt=12): 6 [] p6(A,B)| -p4(C,A)| -p6(C,D)| -p2(D,B).
% 1.69/1.90 ** KEPT (pick-wt=17): 7 [] p2(A,B)| -p6(c7,B)| -p6(c7,A)| -p5(c7,C,B)| -p5(c7,C,A).
% 1.69/1.90 ** KEPT (pick-wt=17): 8 [] p5(A,B,C)| -p2(D,B)| -p2(E,C)| -p4(F,A)| -p5(F,D,E).
% 1.69/1.90
% 1.69/1.90 ------------> process sos:
% 1.69/1.90 ** KEPT (pick-wt=3): 9 [] p2(A,A).
% 1.69/1.90 ** KEPT (pick-wt=3): 10 [] p4(A,A).
% 1.69/1.90 ** KEPT (pick-wt=4): 11 [] p6(c7,f3(A)).
% 1.69/1.90 ** KEPT (pick-wt=4): 12 [] p5(c7,c10,c9).
% 1.69/1.90 ** KEPT (pick-wt=4): 13 [] p5(c7,c10,c8).
% 1.69/1.90 ** KEPT (pick-wt=5): 14 [] p5(c7,A,f3(A)).
% 1.69/1.90
% 1.69/1.90 ======= end of input processing =======
% 1.69/1.90
% 1.69/1.90 =========== start of search ===========
% 1.69/1.90
% 1.69/1.90 -------- PROOF --------
% 1.69/1.90
% 1.69/1.90 -----> EMPTY CLAUSE at 0.00 sec ----> 69 [hyper,43,2,14] $F.
% 1.69/1.90
% 1.69/1.90 Length of proof is 4. Level of proof is 3.
% 1.69/1.90
% 1.69/1.90 ---------------- PROOF ----------------
% 1.69/1.90 % SZS status Unsatisfiable
% 1.69/1.90 % SZS output start Refutation
% See solution above
% 1.69/1.90 ------------ end of proof -------------
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Search stopped by max_proofs option.
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Search stopped by max_proofs option.
% 1.69/1.90
% 1.69/1.90 ============ end of search ============
% 1.69/1.90
% 1.69/1.90 -------------- statistics -------------
% 1.69/1.90 clauses given 18
% 1.69/1.90 clauses generated 148
% 1.69/1.90 clauses kept 68
% 1.69/1.90 clauses forward subsumed 93
% 1.69/1.90 clauses back subsumed 0
% 1.69/1.90 Kbytes malloced 976
% 1.69/1.90
% 1.69/1.90 ----------- times (seconds) -----------
% 1.69/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.90 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.69/1.90
% 1.69/1.90 That finishes the proof of the theorem.
% 1.69/1.90
% 1.69/1.90 Process 14106 finished Wed Jul 27 10:56:43 2022
% 1.69/1.90 Otter interrupted
% 1.69/1.90 PROOF FOUND
%------------------------------------------------------------------------------