TSTP Solution File: SYN584-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN584-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n008.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:57 EDT 2022
% Result : Unsatisfiable 1.73s 1.93s
% Output : Refutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 10 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 15 ( 0 equ; 6 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 8 ( 3 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
( p12(A,B)
| ~ p12(C,A)
| ~ p12(C,B) ),
file('SYN584-1.p',unknown),
[] ).
cnf(10,axiom,
( p15(A,B)
| ~ p15(C,D)
| ~ p3(D,B)
| ~ p12(C,A) ),
file('SYN584-1.p',unknown),
[] ).
cnf(17,axiom,
~ p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))),
file('SYN584-1.p',unknown),
[] ).
cnf(18,axiom,
p12(A,A),
file('SYN584-1.p',unknown),
[] ).
cnf(21,axiom,
p3(A,A),
file('SYN584-1.p',unknown),
[] ).
cnf(23,axiom,
p15(c22,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))),
file('SYN584-1.p',unknown),
[] ).
cnf(25,axiom,
p12(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),c22),
file('SYN584-1.p',unknown),
[] ).
cnf(30,plain,
p12(c22,f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17))),
inference(hyper,[status(thm)],[25,4,18]),
[iquote('hyper,25,4,18')] ).
cnf(37,plain,
p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))),
inference(hyper,[status(thm)],[30,10,23,21]),
[iquote('hyper,30,10,23,21')] ).
cnf(38,plain,
$false,
inference(binary,[status(thm)],[37,17]),
[iquote('binary,37.1,17.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN584-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n008.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.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 11:07:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.73/1.93 ----- Otter 3.3f, August 2004 -----
% 1.73/1.93 The process was started by sandbox2 on n008.cluster.edu,
% 1.73/1.93 Wed Jul 27 11:07:23 2022
% 1.73/1.93 The command was "./otter". The process ID is 1062.
% 1.73/1.93
% 1.73/1.93 set(prolog_style_variables).
% 1.73/1.93 set(auto).
% 1.73/1.93 dependent: set(auto1).
% 1.73/1.93 dependent: set(process_input).
% 1.73/1.93 dependent: clear(print_kept).
% 1.73/1.93 dependent: clear(print_new_demod).
% 1.73/1.93 dependent: clear(print_back_demod).
% 1.73/1.93 dependent: clear(print_back_sub).
% 1.73/1.93 dependent: set(control_memory).
% 1.73/1.93 dependent: assign(max_mem, 12000).
% 1.73/1.93 dependent: assign(pick_given_ratio, 4).
% 1.73/1.93 dependent: assign(stats_level, 1).
% 1.73/1.93 dependent: assign(max_seconds, 10800).
% 1.73/1.93 clear(print_given).
% 1.73/1.93
% 1.73/1.93 list(usable).
% 1.73/1.93 0 [] p12(X0,X0).
% 1.73/1.93 0 [] p6(X42,X42).
% 1.73/1.93 0 [] p5(X31,X31).
% 1.73/1.93 0 [] p3(X26,X26).
% 1.73/1.93 0 [] p2(X19,X19).
% 1.73/1.93 0 [] p5(f11(X36),f11(X37))| -p5(X36,X37).
% 1.73/1.93 0 [] p3(f4(X29),f4(X30))| -p2(X29,X30).
% 1.73/1.93 0 [] p5(f10(X34),f10(X35))| -p5(X34,X35).
% 1.73/1.93 0 [] p12(X1,X2)| -p12(X0,X1)| -p12(X0,X2).
% 1.73/1.93 0 [] p6(X43,X44)| -p6(X42,X43)| -p6(X42,X44).
% 1.73/1.93 0 [] p5(X32,X33)| -p5(X31,X32)| -p5(X31,X33).
% 1.73/1.93 0 [] p3(X27,X28)| -p3(X26,X27)| -p3(X26,X28).
% 1.73/1.93 0 [] p2(X20,X21)| -p2(X19,X20)| -p2(X19,X21).
% 1.73/1.93 0 [] p16(X15,X16)| -p12(X18,X16)| -p16(X17,X18)| -p12(X17,X15).
% 1.73/1.93 0 [] p15(X11,X12)| -p15(X13,X14)| -p3(X14,X12)| -p12(X13,X11).
% 1.73/1.93 0 [] p12(f13(X3,X4),f13(X5,X6))| -p12(X3,X5)| -p12(X4,X6).
% 1.73/1.93 0 [] p6(f8(X45,X46),f8(X47,X48))| -p5(X45,X47)| -p5(X46,X48).
% 1.73/1.93 0 [] p5(f9(X38,X39),f9(X40,X41))| -p5(X38,X40)| -p5(X39,X41).
% 1.73/1.93 0 [] p2(f7(X22,X23),f7(X24,X25))| -p5(X22,X24)| -p6(X23,X25).
% 1.73/1.93 0 [] p12(f14(X7,X8),f14(X9,X10))| -p12(X8,X10)| -p2(X7,X9).
% 1.73/1.93 0 [] p15(c22,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))).
% 1.73/1.93 0 [] p15(c17,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))).
% 1.73/1.93 0 [] p12(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),c22).
% 1.73/1.93 0 [] -p16(X49,c17)| -p16(c22,X49)| -p15(X49,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))).
% 1.73/1.93 0 [] -p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))).
% 1.73/1.93 end_of_list.
% 1.73/1.93
% 1.73/1.93 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 1.73/1.93
% 1.73/1.93 This is a Horn set without equality. The strategy will
% 1.73/1.93 be hyperresolution, with satellites in sos and nuclei
% 1.73/1.93 in usable.
% 1.73/1.93
% 1.73/1.93 dependent: set(hyper_res).
% 1.73/1.93 dependent: clear(order_hyper).
% 1.73/1.93
% 1.73/1.93 ------------> process usable:
% 1.73/1.93 ** KEPT (pick-wt=8): 1 [] p5(f11(A),f11(B))| -p5(A,B).
% 1.73/1.93 ** KEPT (pick-wt=8): 2 [] p3(f4(A),f4(B))| -p2(A,B).
% 1.73/1.93 ** KEPT (pick-wt=8): 3 [] p5(f10(A),f10(B))| -p5(A,B).
% 1.73/1.93 ** KEPT (pick-wt=9): 4 [] p12(A,B)| -p12(C,A)| -p12(C,B).
% 1.73/1.93 ** KEPT (pick-wt=9): 5 [] p6(A,B)| -p6(C,A)| -p6(C,B).
% 1.73/1.93 ** KEPT (pick-wt=9): 6 [] p5(A,B)| -p5(C,A)| -p5(C,B).
% 1.73/1.93 ** KEPT (pick-wt=9): 7 [] p3(A,B)| -p3(C,A)| -p3(C,B).
% 1.73/1.93 ** KEPT (pick-wt=9): 8 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 1.73/1.93 ** KEPT (pick-wt=12): 9 [] p16(A,B)| -p12(C,B)| -p16(D,C)| -p12(D,A).
% 1.73/1.93 ** KEPT (pick-wt=12): 10 [] p15(A,B)| -p15(C,D)| -p3(D,B)| -p12(C,A).
% 1.73/1.93 ** KEPT (pick-wt=13): 11 [] p12(f13(A,B),f13(C,D))| -p12(A,C)| -p12(B,D).
% 1.73/1.93 ** KEPT (pick-wt=13): 12 [] p6(f8(A,B),f8(C,D))| -p5(A,C)| -p5(B,D).
% 1.73/1.93 ** KEPT (pick-wt=13): 13 [] p5(f9(A,B),f9(C,D))| -p5(A,C)| -p5(B,D).
% 1.73/1.93 ** KEPT (pick-wt=13): 14 [] p2(f7(A,B),f7(C,D))| -p5(A,C)| -p6(B,D).
% 1.73/1.93 ** KEPT (pick-wt=13): 15 [] p12(f14(A,B),f14(C,D))| -p12(B,D)| -p2(A,C).
% 1.73/1.93 ** KEPT (pick-wt=22): 16 [] -p16(A,c17)| -p16(c22,A)| -p15(A,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))).
% 1.73/1.93 ** KEPT (pick-wt=32): 17 [] -p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))).
% 1.73/1.93
% 1.73/1.93 ------------> process sos:
% 1.73/1.93 ** KEPT (pick-wt=3): 18 [] p12(A,A).
% 1.73/1.93 ** KEPT (pick-wt=3): 19 [] p6(A,A).
% 1.73/1.93 ** KEPT (pick-wt=3): 20 [] p5(A,A).
% 1.73/1.93 ** KEPT (pick-wt=3): 21 [] p3(A,A).
% 1.73/1.93 ** KEPT (pick-wt=3): 22 [] p2(A,A).
% 1.73/1.93 ** KEPT (pick-wt=16): 23 [] p15(c22,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))).
% 1.73/1.93 ** KEPT (pick-wt=16): 24 [] p15(c17,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))).
% 1.73/1.93 ** KEPT (pick-wt=19): 25 [] p12(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),c22).
% 1.73/1.93
% 1.73/1.93 ======= end of input processing =======
% 1.73/1.93
% 1.73/1.93 =========== start of search ===========
% 1.73/1.93
% 1.73/1.93 -------- PROOF --------
% 1.73/1.93
% 1.73/1.93 ----> UNIT CONFLICT at 0.00 sec ----> 38 [binary,37.1,17.1] $F.
% 1.73/1.93
% 1.73/1.93 Length of proof is 2. Level of proof is 2.
% 1.73/1.93
% 1.73/1.93 ---------------- PROOF ----------------
% 1.73/1.93 % SZS status Unsatisfiable
% 1.73/1.93 % SZS output start Refutation
% See solution above
% 1.73/1.93 ------------ end of proof -------------
% 1.73/1.93
% 1.73/1.93
% 1.73/1.93 Search stopped by max_proofs option.
% 1.73/1.93
% 1.73/1.93
% 1.73/1.93 Search stopped by max_proofs option.
% 1.73/1.93
% 1.73/1.93 ============ end of search ============
% 1.73/1.93
% 1.73/1.93 -------------- statistics -------------
% 1.73/1.93 clauses given 9
% 1.73/1.93 clauses generated 40
% 1.73/1.93 clauses kept 37
% 1.73/1.93 clauses forward subsumed 28
% 1.73/1.93 clauses back subsumed 0
% 1.73/1.93 Kbytes malloced 976
% 1.73/1.93
% 1.73/1.93 ----------- times (seconds) -----------
% 1.73/1.93 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.93 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.93 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.73/1.93
% 1.73/1.93 That finishes the proof of the theorem.
% 1.73/1.93
% 1.73/1.93 Process 1062 finished Wed Jul 27 11:07:25 2022
% 1.73/1.93 Otter interrupted
% 1.73/1.93 PROOF FOUND
%------------------------------------------------------------------------------