TSTP Solution File: NUN070+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUN070+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:10:29 EDT 2022
% Result : Theorem 2.21s 2.39s
% Output : Refutation 2.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 8 unt; 0 nHn; 7 RR)
% Number of literals : 33 ( 0 equ; 22 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 28 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( id(A,dollar_c1)
| ~ r1(A) ),
file('NUN070+1.p',unknown),
[] ).
cnf(4,axiom,
( r2(A,B)
| ~ id(B,dollar_f1(A)) ),
file('NUN070+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ id(A,B)
| ~ id(C,D)
| ~ r2(B,D)
| r2(A,C) ),
file('NUN070+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ r1(A)
| ~ r3(B,A,C)
| ~ r1(D)
| ~ r2(D,B)
| ~ id(C,E)
| ~ r1(F)
| ~ r2(F,E) ),
file('NUN070+1.p',unknown),
[] ).
cnf(37,plain,
( ~ r1(A)
| ~ r3(B,A,C)
| ~ r2(A,B)
| ~ id(C,D)
| ~ r1(E)
| ~ r2(E,D) ),
inference(factor,[status(thm)],[21]),
[iquote('factor,21.1.3')] ).
cnf(46,plain,
( ~ r1(A)
| ~ r3(B,A,C)
| ~ r2(A,B)
| ~ id(C,B) ),
inference(factor_simp,[status(thm)],[inference(factor,[status(thm)],[37])]),
[iquote('factor,37.3.6,factor_simp')] ).
cnf(47,axiom,
id(A,A),
file('NUN070+1.p',unknown),
[] ).
cnf(58,axiom,
id(dollar_f13(A),A),
file('NUN070+1.p',unknown),
[] ).
cnf(59,axiom,
r1(dollar_f12(A)),
file('NUN070+1.p',unknown),
[] ).
cnf(60,axiom,
r3(A,dollar_f12(A),dollar_f13(A)),
file('NUN070+1.p',unknown),
[] ).
cnf(71,plain,
r2(A,dollar_f1(A)),
inference(hyper,[status(thm)],[47,4]),
[iquote('hyper,47,4')] ).
cnf(73,plain,
id(dollar_f12(A),dollar_c1),
inference(hyper,[status(thm)],[59,1]),
[iquote('hyper,59,1')] ).
cnf(95,plain,
r2(dollar_f12(A),dollar_f1(dollar_c1)),
inference(hyper,[status(thm)],[73,14,47,71]),
[iquote('hyper,73,14,47,71')] ).
cnf(3441,plain,
$false,
inference(hyper,[status(thm)],[60,46,59,95,58]),
[iquote('hyper,60,46,59,95,58')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUN070+1 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n026.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 02:51:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.95/2.14 ----- Otter 3.3f, August 2004 -----
% 1.95/2.14 The process was started by sandbox on n026.cluster.edu,
% 1.95/2.14 Wed Jul 27 02:51:54 2022
% 1.95/2.14 The command was "./otter". The process ID is 5296.
% 1.95/2.14
% 1.95/2.14 set(prolog_style_variables).
% 1.95/2.14 set(auto).
% 1.95/2.14 dependent: set(auto1).
% 1.95/2.14 dependent: set(process_input).
% 1.95/2.14 dependent: clear(print_kept).
% 1.95/2.14 dependent: clear(print_new_demod).
% 1.95/2.14 dependent: clear(print_back_demod).
% 1.95/2.14 dependent: clear(print_back_sub).
% 1.95/2.14 dependent: set(control_memory).
% 1.95/2.14 dependent: assign(max_mem, 12000).
% 1.95/2.14 dependent: assign(pick_given_ratio, 4).
% 1.95/2.14 dependent: assign(stats_level, 1).
% 1.95/2.14 dependent: assign(max_seconds, 10800).
% 1.95/2.14 clear(print_given).
% 1.95/2.14
% 1.95/2.14 formula_list(usable).
% 1.95/2.14 exists Y24 all X19 (id(X19,Y24)&r1(X19)| -r1(X19)& -id(X19,Y24)).
% 1.95/2.14 all X11 exists Y21 all X12 (id(X12,Y21)&r2(X11,X12)| -r2(X11,X12)& -id(X12,Y21)).
% 1.95/2.14 all X13 X14 exists Y22 all X15 (id(X15,Y22)&r3(X13,X14,X15)| -r3(X13,X14,X15)& -id(X15,Y22)).
% 1.95/2.14 all X16 X17 exists Y23 all X18 (id(X18,Y23)&r4(X16,X17,X18)| -r4(X16,X17,X18)& -id(X18,Y23)).
% 1.95/2.14 all X20 id(X20,X20).
% 1.95/2.14 all X21 X22 (-id(X21,X22)|id(X22,X21)).
% 1.95/2.14 all X23 X24 X25 (-id(X23,X24)|id(X23,X25)| -id(X24,X25)).
% 1.95/2.14 all X26 X27 (-id(X26,X27)| -r1(X26)& -r1(X27)|r1(X26)&r1(X27)).
% 1.95/2.14 all X28 X29 X30 X31 (-id(X28,X30)| -id(X29,X31)| -r2(X28,X29)& -r2(X30,X31)|r2(X28,X29)&r2(X30,X31)).
% 1.95/2.14 all X32 X33 X34 X35 X36 X37 (-id(X32,X35)| -id(X33,X36)| -id(X34,X37)| -r3(X32,X33,X34)& -r3(X35,X36,X37)|r3(X32,X33,X34)&r3(X35,X36,X37)).
% 1.95/2.14 all X38 X39 X40 X41 X42 X43 (-id(X38,X41)| -id(X39,X42)| -id(X40,X43)| -r4(X38,X39,X40)& -r4(X41,X42,X43)|r4(X38,X39,X40)&r4(X41,X42,X43)).
% 1.95/2.14 all X1 X8 exists Y4 ((exists Y5 (id(Y5,Y4)& (exists Y15 (r2(X8,Y15)&r3(X1,Y15,Y5)))))& (exists Y7 (r2(Y7,Y4)&r3(X1,X8,Y7)))).
% 1.95/2.14 all X2 X9 exists Y2 ((exists Y3 (id(Y3,Y2)& (exists Y14 (r2(X9,Y14)&r4(X2,Y14,Y3)))))& (exists Y6 (r3(Y6,X2,Y2)&r4(X2,X9,Y6)))).
% 1.95/2.14 all X3 X10 ((all Y12 ((all Y13 (-id(Y13,Y12)| -r2(X3,Y13)))| -r2(X10,Y12)))|id(X3,X10)).
% 1.95/2.14 all X4 exists Y9 (id(Y9,X4)& (exists Y16 (r1(Y16)&r3(X4,Y16,Y9)))).
% 1.95/2.14 all X5 exists Y8 ((exists Y17 (r1(Y17)&r4(X5,Y17,Y8)))& (exists Y18 (id(Y8,Y18)&r1(Y18)))).
% 1.95/2.14 all X6 ((exists Y19 (id(X6,Y19)&r1(Y19)))| (exists Y1 Y11 (id(X6,Y11)&r2(Y1,Y11)))).
% 1.95/2.14 all X7 Y10 ((all Y20 (-id(Y20,Y10)| -r1(Y20)))| -r2(X7,Y10)).
% 1.95/2.14 -(exists Y1 ((exists Y2 ((exists Y4 (r1(Y4)&r3(Y2,Y4,Y1)))& (exists Y5 (r1(Y5)&r2(Y5,Y2)))))& (exists Y3 (id(Y1,Y3)& (exists Y6 (r1(Y6)&r2(Y6,Y3))))))).
% 1.95/2.14 end_of_list.
% 1.95/2.14
% 1.95/2.14 -------> usable clausifies to:
% 1.95/2.14
% 1.95/2.14 list(usable).
% 1.95/2.14 0 [] id(X19,$c1)| -r1(X19).
% 1.95/2.14 0 [] r1(X19)| -id(X19,$c1).
% 1.95/2.14 0 [] id(X12,$f1(X11))| -r2(X11,X12).
% 1.95/2.14 0 [] r2(X11,X12)| -id(X12,$f1(X11)).
% 1.95/2.14 0 [] id(X15,$f2(X13,X14))| -r3(X13,X14,X15).
% 1.95/2.14 0 [] r3(X13,X14,X15)| -id(X15,$f2(X13,X14)).
% 1.95/2.14 0 [] id(X18,$f3(X16,X17))| -r4(X16,X17,X18).
% 1.95/2.14 0 [] r4(X16,X17,X18)| -id(X18,$f3(X16,X17)).
% 1.95/2.14 0 [] id(X20,X20).
% 1.95/2.14 0 [] -id(X21,X22)|id(X22,X21).
% 1.95/2.14 0 [] -id(X23,X24)|id(X23,X25)| -id(X24,X25).
% 1.95/2.14 0 [] -id(X26,X27)| -r1(X26)|r1(X27).
% 1.95/2.14 0 [] -id(X26,X27)| -r1(X27)|r1(X26).
% 1.95/2.14 0 [] -id(X28,X30)| -id(X29,X31)| -r2(X28,X29)|r2(X30,X31).
% 1.95/2.14 0 [] -id(X28,X30)| -id(X29,X31)| -r2(X30,X31)|r2(X28,X29).
% 1.95/2.14 0 [] -id(X32,X35)| -id(X33,X36)| -id(X34,X37)| -r3(X32,X33,X34)|r3(X35,X36,X37).
% 1.95/2.14 0 [] -id(X32,X35)| -id(X33,X36)| -id(X34,X37)| -r3(X35,X36,X37)|r3(X32,X33,X34).
% 1.95/2.14 0 [] -id(X38,X41)| -id(X39,X42)| -id(X40,X43)| -r4(X38,X39,X40)|r4(X41,X42,X43).
% 1.95/2.14 0 [] -id(X38,X41)| -id(X39,X42)| -id(X40,X43)| -r4(X41,X42,X43)|r4(X38,X39,X40).
% 1.95/2.14 0 [] id($f5(X1,X8),$f7(X1,X8)).
% 1.95/2.14 0 [] r2(X8,$f4(X1,X8)).
% 1.95/2.14 0 [] r3(X1,$f4(X1,X8),$f5(X1,X8)).
% 1.95/2.14 0 [] r2($f6(X1,X8),$f7(X1,X8)).
% 1.95/2.14 0 [] r3(X1,X8,$f6(X1,X8)).
% 1.95/2.14 0 [] id($f9(X2,X9),$f11(X2,X9)).
% 1.95/2.14 0 [] r2(X9,$f8(X2,X9)).
% 1.95/2.14 0 [] r4(X2,$f8(X2,X9),$f9(X2,X9)).
% 1.95/2.14 0 [] r3($f10(X2,X9),X2,$f11(X2,X9)).
% 1.95/2.14 0 [] r4(X2,X9,$f10(X2,X9)).
% 1.95/2.14 0 [] -id(Y13,Y12)| -r2(X3,Y13)| -r2(X10,Y12)|id(X3,X10).
% 1.95/2.14 0 [] id($f13(X4),X4).
% 1.95/2.14 0 [] r1($f12(X4)).
% 1.95/2.14 0 [] r3(X4,$f12(X4),$f13(X4)).
% 1.95/2.14 0 [] r1($f14(X5)).
% 1.95/2.14 0 [] r4(X5,$f14(X5),$f16(X5)).
% 1.95/2.14 0 [] id($f16(X5),$f15(X5)).
% 1.95/2.14 0 [] r1($f15(X5)).
% 1.95/2.14 0 [] id(X6,$f17(X6))|id(X6,$f18(X6)).
% 1.95/2.14 0 [] id(X6,$f17(X6))|r2($f19(X6),$f18(X6)).
% 1.95/2.14 0 [] r1($f17(X6))|id(X6,$f18(X6)).
% 1.95/2.14 0 [] r1($f17(X6))|r2($f19(X6),$f18(X6)).
% 1.95/2.14 0 [] -id(Y20,Y10)| -r1(Y20)| -r2(X7,Y10).
% 1.95/2.14 0 [] -r1(Y4)| -r3(Y2,Y4,Y1)| -r1(Y5)| -r2(Y5,Y2)| -id(Y1,Y3)| -r1(Y6)| -r2(Y6,Y3).
% 2.21/2.39 end_of_list.
% 2.21/2.39
% 2.21/2.39 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=7.
% 2.21/2.39
% 2.21/2.39 This is a non-Horn set without equality. The strategy will
% 2.21/2.39 be ordered hyper_res, unit deletion, and factoring, with
% 2.21/2.39 satellites in sos and with nuclei in usable.
% 2.21/2.39
% 2.21/2.39 dependent: set(hyper_res).
% 2.21/2.39 dependent: set(factor).
% 2.21/2.39 dependent: set(unit_deletion).
% 2.21/2.39
% 2.21/2.39 ------------> process usable:
% 2.21/2.39 ** KEPT (pick-wt=5): 1 [] id(A,$c1)| -r1(A).
% 2.21/2.39 ** KEPT (pick-wt=5): 2 [] r1(A)| -id(A,$c1).
% 2.21/2.39 ** KEPT (pick-wt=7): 3 [] id(A,$f1(B))| -r2(B,A).
% 2.21/2.39 ** KEPT (pick-wt=7): 4 [] r2(A,B)| -id(B,$f1(A)).
% 2.21/2.39 ** KEPT (pick-wt=9): 5 [] id(A,$f2(B,C))| -r3(B,C,A).
% 2.21/2.39 ** KEPT (pick-wt=9): 6 [] r3(A,B,C)| -id(C,$f2(A,B)).
% 2.21/2.39 ** KEPT (pick-wt=9): 7 [] id(A,$f3(B,C))| -r4(B,C,A).
% 2.21/2.39 ** KEPT (pick-wt=9): 8 [] r4(A,B,C)| -id(C,$f3(A,B)).
% 2.21/2.39 ** KEPT (pick-wt=6): 9 [] -id(A,B)|id(B,A).
% 2.21/2.39 ** KEPT (pick-wt=9): 10 [] -id(A,B)|id(A,C)| -id(B,C).
% 2.21/2.39 ** KEPT (pick-wt=7): 11 [] -id(A,B)| -r1(A)|r1(B).
% 2.21/2.39 ** KEPT (pick-wt=7): 12 [] -id(A,B)| -r1(B)|r1(A).
% 2.21/2.39 ** KEPT (pick-wt=12): 13 [] -id(A,B)| -id(C,D)| -r2(A,C)|r2(B,D).
% 2.21/2.39 ** KEPT (pick-wt=12): 14 [] -id(A,B)| -id(C,D)| -r2(B,D)|r2(A,C).
% 2.21/2.39 ** KEPT (pick-wt=17): 15 [] -id(A,B)| -id(C,D)| -id(E,F)| -r3(A,C,E)|r3(B,D,F).
% 2.21/2.39 ** KEPT (pick-wt=17): 16 [] -id(A,B)| -id(C,D)| -id(E,F)| -r3(B,D,F)|r3(A,C,E).
% 2.21/2.39 ** KEPT (pick-wt=17): 17 [] -id(A,B)| -id(C,D)| -id(E,F)| -r4(A,C,E)|r4(B,D,F).
% 2.21/2.39 ** KEPT (pick-wt=17): 18 [] -id(A,B)| -id(C,D)| -id(E,F)| -r4(B,D,F)|r4(A,C,E).
% 2.21/2.39 ** KEPT (pick-wt=12): 19 [] -id(A,B)| -r2(C,A)| -r2(D,B)|id(C,D).
% 2.21/2.39 ** KEPT (pick-wt=8): 20 [] -id(A,B)| -r1(A)| -r2(C,B).
% 2.21/2.39 ** KEPT (pick-wt=19): 21 [] -r1(A)| -r3(B,A,C)| -r1(D)| -r2(D,B)| -id(C,E)| -r1(F)| -r2(F,E).
% 2.21/2.39
% 2.21/2.39 ------------> process sos:
% 2.21/2.39 ** KEPT (pick-wt=3): 47 [] id(A,A).
% 2.21/2.39 ** KEPT (pick-wt=7): 48 [] id($f5(A,B),$f7(A,B)).
% 2.21/2.39 ** KEPT (pick-wt=5): 49 [] r2(A,$f4(B,A)).
% 2.21/2.39 ** KEPT (pick-wt=8): 50 [] r3(A,$f4(A,B),$f5(A,B)).
% 2.21/2.39 ** KEPT (pick-wt=7): 51 [] r2($f6(A,B),$f7(A,B)).
% 2.21/2.39 ** KEPT (pick-wt=6): 52 [] r3(A,B,$f6(A,B)).
% 2.21/2.39 ** KEPT (pick-wt=7): 53 [] id($f9(A,B),$f11(A,B)).
% 2.21/2.39 ** KEPT (pick-wt=5): 54 [] r2(A,$f8(B,A)).
% 2.21/2.39 ** KEPT (pick-wt=8): 55 [] r4(A,$f8(A,B),$f9(A,B)).
% 2.21/2.39 ** KEPT (pick-wt=8): 56 [] r3($f10(A,B),A,$f11(A,B)).
% 2.21/2.39 ** KEPT (pick-wt=6): 57 [] r4(A,B,$f10(A,B)).
% 2.21/2.39 ** KEPT (pick-wt=4): 58 [] id($f13(A),A).
% 2.21/2.39 ** KEPT (pick-wt=3): 59 [] r1($f12(A)).
% 2.21/2.39 ** KEPT (pick-wt=6): 60 [] r3(A,$f12(A),$f13(A)).
% 2.21/2.39 ** KEPT (pick-wt=3): 61 [] r1($f14(A)).
% 2.21/2.39 ** KEPT (pick-wt=6): 62 [] r4(A,$f14(A),$f16(A)).
% 2.21/2.39 ** KEPT (pick-wt=5): 63 [] id($f16(A),$f15(A)).
% 2.21/2.39 ** KEPT (pick-wt=3): 64 [] r1($f15(A)).
% 2.21/2.39 ** KEPT (pick-wt=8): 65 [] id(A,$f17(A))|id(A,$f18(A)).
% 2.21/2.39 ** KEPT (pick-wt=9): 66 [] id(A,$f17(A))|r2($f19(A),$f18(A)).
% 2.21/2.39 ** KEPT (pick-wt=7): 67 [] r1($f17(A))|id(A,$f18(A)).
% 2.21/2.39 ** KEPT (pick-wt=8): 68 [] r1($f17(A))|r2($f19(A),$f18(A)).
% 2.21/2.39 47 back subsumes 36.
% 2.21/2.39
% 2.21/2.39 ======= end of input processing =======
% 2.21/2.39
% 2.21/2.39 =========== start of search ===========
% 2.21/2.39
% 2.21/2.39
% 2.21/2.39 Resetting weight limit to 7.
% 2.21/2.39
% 2.21/2.39
% 2.21/2.39 Resetting weight limit to 7.
% 2.21/2.39
% 2.21/2.39 sos_size=3208
% 2.21/2.39
% 2.21/2.39 -------- PROOF --------
% 2.21/2.39
% 2.21/2.39 -----> EMPTY CLAUSE at 0.25 sec ----> 3441 [hyper,60,46,59,95,58] $F.
% 2.21/2.39
% 2.21/2.39 Length of proof is 5. Level of proof is 2.
% 2.21/2.39
% 2.21/2.39 ---------------- PROOF ----------------
% 2.21/2.39 % SZS status Theorem
% 2.21/2.39 % SZS output start Refutation
% See solution above
% 2.21/2.39 ------------ end of proof -------------
% 2.21/2.39
% 2.21/2.39
% 2.21/2.39 Search stopped by max_proofs option.
% 2.21/2.39
% 2.21/2.39
% 2.21/2.39 Search stopped by max_proofs option.
% 2.21/2.39
% 2.21/2.39 ============ end of search ============
% 2.21/2.39
% 2.21/2.39 -------------- statistics -------------
% 2.21/2.39 clauses given 51
% 2.21/2.39 clauses generated 5173
% 2.21/2.39 clauses kept 3440
% 2.21/2.39 clauses forward subsumed 1359
% 2.21/2.39 clauses back subsumed 123
% 2.21/2.39 Kbytes malloced 4882
% 2.21/2.39
% 2.21/2.39 ----------- times (seconds) -----------
% 2.21/2.39 user CPU time 0.25 (0 hr, 0 min, 0 sec)
% 2.21/2.39 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.21/2.39 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.21/2.39
% 2.21/2.39 That finishes the proof of the theorem.
% 2.21/2.39
% 2.21/2.39 Process 5296 finished Wed Jul 27 02:51:56 2022
% 2.21/2.39 Otter interrupted
% 2.21/2.39 PROOF FOUND
%------------------------------------------------------------------------------