TSTP Solution File: NUN062+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUN062+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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:27 EDT 2022
% Result : Theorem 1.79s 1.95s
% Output : Refutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 12 ( 7 unt; 0 nHn; 6 RR)
% Number of literals : 21 ( 10 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 21 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
( A != dollar_f1(B)
| r2(B,A) ),
file('NUN062+2.p',unknown),
[] ).
cnf(10,axiom,
( ~ r1(A)
| A != B
| ~ r2(C,B) ),
file('NUN062+2.p',unknown),
[] ).
cnf(11,axiom,
( r1(dollar_f20(A,B))
| ~ r3(dollar_c2,B,C)
| C != A ),
file('NUN062+2.p',unknown),
[] ).
cnf(12,axiom,
( A = dollar_f20(B,A)
| ~ r3(dollar_c2,A,C)
| C != B ),
file('NUN062+2.p',unknown),
[] ).
cnf(13,plain,
( dollar_f20(A,B) = B
| ~ r3(dollar_c2,B,C)
| C != A ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[12])]),
[iquote('copy,12,flip.1')] ).
cnf(15,axiom,
A = A,
file('NUN062+2.p',unknown),
[] ).
cnf(23,axiom,
r3(A,B,dollar_f6(A,B)),
file('NUN062+2.p',unknown),
[] ).
cnf(32,axiom,
dollar_f13(A) = A,
file('NUN062+2.p',unknown),
[] ).
cnf(51,plain,
r2(A,dollar_f1(A)),
inference(hyper,[status(thm)],[15,4]),
[iquote('hyper,15,4')] ).
cnf(114,plain,
dollar_f20(dollar_f6(dollar_c2,A),A) = A,
inference(hyper,[status(thm)],[23,13,15]),
[iquote('hyper,23,13,15')] ).
cnf(115,plain,
r1(A),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[23,11,15]),114]),
[iquote('hyper,23,11,15,demod,114')] ).
cnf(121,plain,
$false,
inference(hyper,[status(thm)],[115,10,32,51]),
[iquote('hyper,115,10,32,51')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUN062+2 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n005.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:32:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.79/1.94 ----- Otter 3.3f, August 2004 -----
% 1.79/1.94 The process was started by sandbox2 on n005.cluster.edu,
% 1.79/1.94 Wed Jul 27 02:32:20 2022
% 1.79/1.94 The command was "./otter". The process ID is 10381.
% 1.79/1.94
% 1.79/1.94 set(prolog_style_variables).
% 1.79/1.94 set(auto).
% 1.79/1.94 dependent: set(auto1).
% 1.79/1.94 dependent: set(process_input).
% 1.79/1.94 dependent: clear(print_kept).
% 1.79/1.94 dependent: clear(print_new_demod).
% 1.79/1.94 dependent: clear(print_back_demod).
% 1.79/1.94 dependent: clear(print_back_sub).
% 1.79/1.94 dependent: set(control_memory).
% 1.79/1.94 dependent: assign(max_mem, 12000).
% 1.79/1.94 dependent: assign(pick_given_ratio, 4).
% 1.79/1.94 dependent: assign(stats_level, 1).
% 1.79/1.94 dependent: assign(max_seconds, 10800).
% 1.79/1.94 clear(print_given).
% 1.79/1.94
% 1.79/1.94 formula_list(usable).
% 1.79/1.94 all A (A=A).
% 1.79/1.94 exists Y24 all X19 (-r1(X19)&X19!=Y24|r1(X19)&X19=Y24).
% 1.79/1.94 all X11 exists Y21 all X12 (-r2(X11,X12)&X12!=Y21|r2(X11,X12)&X12=Y21).
% 1.79/1.94 all X13 X14 exists Y22 all X15 (-r3(X13,X14,X15)&X15!=Y22|r3(X13,X14,X15)&X15=Y22).
% 1.79/1.94 all X16 X17 exists Y23 all X18 (-r4(X16,X17,X18)&X18!=Y23|r4(X16,X17,X18)&X18=Y23).
% 1.79/1.94 all X1 X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15)&r3(X1,Y15,Y5)))&Y5=Y4))& (exists Y7 (r2(Y7,Y4)&r3(X1,X8,Y7)))).
% 1.79/1.95 all X2 X9 exists Y2 ((exists Y3 ((exists Y14 (r2(X9,Y14)&r4(X2,Y14,Y3)))&Y3=Y2))& (exists Y6 (r3(Y6,X2,Y2)&r4(X2,X9,Y6)))).
% 1.79/1.95 all X3 X10 ((all Y12 ((all Y13 (-r2(X3,Y13)|Y13!=Y12))| -r2(X10,Y12)))|X3=X10).
% 1.79/1.95 all X4 exists Y9 ((exists Y16 (r1(Y16)&r3(X4,Y16,Y9)))&Y9=X4).
% 1.79/1.95 all X5 exists Y8 ((exists Y17 (r1(Y17)&r4(X5,Y17,Y8)))& (exists Y18 (r1(Y18)&Y8=Y18))).
% 1.79/1.95 all X6 ((exists Y19 (r1(Y19)&X6=Y19))| (exists Y1 Y11 (r2(Y1,Y11)&X6=Y11))).
% 1.79/1.95 all X7 Y10 ((all Y20 (-r1(Y20)|Y20!=Y10))| -r2(X7,Y10)).
% 1.79/1.95 -(all X1 exists Y2 Y1 ((all Y4 (-r1(Y4)|Y1!=Y4))& (exists Y3 (r3(X1,Y1,Y3)&Y3=Y2)))).
% 1.79/1.95 end_of_list.
% 1.79/1.95
% 1.79/1.95 -------> usable clausifies to:
% 1.79/1.95
% 1.79/1.95 list(usable).
% 1.79/1.95 0 [] A=A.
% 1.79/1.95 0 [] -r1(X19)|X19=$c1.
% 1.79/1.95 0 [] X19!=$c1|r1(X19).
% 1.79/1.95 0 [] -r2(X11,X12)|X12=$f1(X11).
% 1.79/1.95 0 [] X12!=$f1(X11)|r2(X11,X12).
% 1.79/1.95 0 [] -r3(X13,X14,X15)|X15=$f2(X13,X14).
% 1.79/1.95 0 [] X15!=$f2(X13,X14)|r3(X13,X14,X15).
% 1.79/1.95 0 [] -r4(X16,X17,X18)|X18=$f3(X16,X17).
% 1.79/1.95 0 [] X18!=$f3(X16,X17)|r4(X16,X17,X18).
% 1.79/1.95 0 [] r2(X8,$f4(X1,X8)).
% 1.79/1.95 0 [] r3(X1,$f4(X1,X8),$f5(X1,X8)).
% 1.79/1.95 0 [] $f5(X1,X8)=$f7(X1,X8).
% 1.79/1.95 0 [] r2($f6(X1,X8),$f7(X1,X8)).
% 1.79/1.95 0 [] r3(X1,X8,$f6(X1,X8)).
% 1.79/1.95 0 [] r2(X9,$f8(X2,X9)).
% 1.79/1.95 0 [] r4(X2,$f8(X2,X9),$f9(X2,X9)).
% 1.79/1.95 0 [] $f9(X2,X9)=$f11(X2,X9).
% 1.79/1.95 0 [] r3($f10(X2,X9),X2,$f11(X2,X9)).
% 1.79/1.95 0 [] r4(X2,X9,$f10(X2,X9)).
% 1.79/1.95 0 [] -r2(X3,Y13)|Y13!=Y12| -r2(X10,Y12)|X3=X10.
% 1.79/1.95 0 [] r1($f12(X4)).
% 1.79/1.95 0 [] r3(X4,$f12(X4),$f13(X4)).
% 1.79/1.95 0 [] $f13(X4)=X4.
% 1.79/1.95 0 [] r1($f14(X5)).
% 1.79/1.95 0 [] r4(X5,$f14(X5),$f16(X5)).
% 1.79/1.95 0 [] r1($f15(X5)).
% 1.79/1.95 0 [] $f16(X5)=$f15(X5).
% 1.79/1.95 0 [] r1($f17(X6))|r2($f19(X6),$f18(X6)).
% 1.79/1.95 0 [] r1($f17(X6))|X6=$f18(X6).
% 1.79/1.95 0 [] X6=$f17(X6)|r2($f19(X6),$f18(X6)).
% 1.79/1.95 0 [] X6=$f17(X6)|X6=$f18(X6).
% 1.79/1.95 0 [] -r1(Y20)|Y20!=Y10| -r2(X7,Y10).
% 1.79/1.95 0 [] r1($f20(Y2,Y1))| -r3($c2,Y1,Y3)|Y3!=Y2.
% 1.79/1.95 0 [] Y1=$f20(Y2,Y1)| -r3($c2,Y1,Y3)|Y3!=Y2.
% 1.79/1.95 end_of_list.
% 1.79/1.95
% 1.79/1.95 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.79/1.95
% 1.79/1.95 This ia a non-Horn set with equality. The strategy will be
% 1.79/1.95 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.79/1.95 deletion, with positive clauses in sos and nonpositive
% 1.79/1.95 clauses in usable.
% 1.79/1.95
% 1.79/1.95 dependent: set(knuth_bendix).
% 1.79/1.95 dependent: set(anl_eq).
% 1.79/1.95 dependent: set(para_from).
% 1.79/1.95 dependent: set(para_into).
% 1.79/1.95 dependent: clear(para_from_right).
% 1.79/1.95 dependent: clear(para_into_right).
% 1.79/1.95 dependent: set(para_from_vars).
% 1.79/1.95 dependent: set(eq_units_both_ways).
% 1.79/1.95 dependent: set(dynamic_demod_all).
% 1.79/1.95 dependent: set(dynamic_demod).
% 1.79/1.95 dependent: set(order_eq).
% 1.79/1.95 dependent: set(back_demod).
% 1.79/1.95 dependent: set(lrpo).
% 1.79/1.95 dependent: set(hyper_res).
% 1.79/1.95 dependent: set(unit_deletion).
% 1.79/1.95 dependent: set(factor).
% 1.79/1.95
% 1.79/1.95 ------------> process usable:
% 1.79/1.95 ** KEPT (pick-wt=5): 1 [] -r1(A)|A=$c1.
% 1.79/1.95 ** KEPT (pick-wt=5): 2 [] A!=$c1|r1(A).
% 1.79/1.95 ** KEPT (pick-wt=7): 3 [] -r2(A,B)|B=$f1(A).
% 1.79/1.95 ** KEPT (pick-wt=7): 4 [] A!=$f1(B)|r2(B,A).
% 1.79/1.95 ** KEPT (pick-wt=9): 5 [] -r3(A,B,C)|C=$f2(A,B).
% 1.79/1.95 ** KEPT (pick-wt=9): 6 [] A!=$f2(B,C)|r3(B,C,A).
% 1.79/1.95 ** KEPT (pick-wt=9): 7 [] -r4(A,B,C)|C=$f3(A,B).
% 1.79/1.95 ** KEPT (pick-wt=9): 8 [] A!=$f3(B,C)|r4(B,C,A).
% 1.79/1.95 ** KEPT (pick-wt=12): 9 [] -r2(A,B)|B!=C| -r2(D,C)|A=D.
% 1.79/1.95 ** KEPT (pick-wt=8): 10 [] -r1(A)|A!=B| -r2(C,B).
% 1.79/1.95 ** KEPT (pick-wt=11): 11 [] r1($f20(A,B))| -r3($c2,B,C)|C!=A.
% 1.79/1.95 ** KEPT (pick-wt=12): 13 [copy,12,flip.1] $f20(A,B)=B| -r3($c2,B,C)|C!=A.
% 1.79/1.95
% 1.79/1.95 ------------> process sos:
% 1.79/1.95 ** KEPT (pick-wt=3): 15 [] A=A.
% 1.79/1.95 ** KEPT (pick-wt=5): 16 [] r2(A,$f4(B,A)).
% 1.79/1.95 ** KEPT (pick-wt=8): 17 [] r3(A,$f4(A,B),$f5(A,B)).
% 1.79/1.95 ** KEPT (pick-wt=7): 19 [copy,18,flip.1] $f7(A,B)=$f5(A,B).
% 1.79/1.95 ---> New Demodulator: 20 [new_demod,19] $f7(A,B)=$f5(A,B).
% 1.79/1.95 ** KEPT (pick-wt=7): 22 [copy,21,demod,20] r2($f6(A,B),$f5(A,B)).
% 1.79/1.95 ** KEPT (pick-wt=6): 23 [] r3(A,B,$f6(A,B)).
% 1.79/1.95 ** KEPT (pick-wt=5): 24 [] r2(A,$f8(B,A)).
% 1.79/1.95 ** KEPT (pick-wt=8): 25 [] r4(A,$f8(A,B),$f9(A,B)).
% 1.79/1.95 ** KEPT (pick-wt=7): 26 [] $f9(A,B)=$f11(A,B).
% 1.79/1.95 ---> New Demodulator: 27 [new_demod,26] $f9(A,B)=$f11(A,B).
% 1.79/1.95 ** KEPT (pick-wt=8): 28 [] r3($f10(A,B),A,$f11(A,B)).
% 1.79/1.95 ** KEPT (pick-wt=6): 29 [] r4(A,B,$f10(A,B)).
% 1.79/1.95 ** KEPT (pick-wt=3): 30 [] r1($f12(A)).
% 1.79/1.95 ** KEPT (pick-wt=6): 31 [] r3(A,$f12(A),$f13(A)).
% 1.79/1.95 ** KEPT (pick-wt=4): 32 [] $f13(A)=A.
% 1.79/1.95 ---> New Demodulator: 33 [new_demod,32] $f13(A)=A.
% 1.79/1.95 ** KEPT (pick-wt=3): 34 [] r1($f14(A)).
% 1.79/1.95 ** KEPT (pick-wt=6): 35 [] r4(A,$f14(A),$f16(A)).
% 1.79/1.95 ** KEPT (pick-wt=3): 36 [] r1($f15(A)).
% 1.79/1.95 ** KEPT (pick-wt=5): 37 [] $f16(A)=$f15(A).
% 1.79/1.95 ---> New Demodulator: 38 [new_demod,37] $f16(A)=$f15(A).
% 1.79/1.95 ** KEPT (pick-wt=8): 39 [] r1($f17(A))|r2($f19(A),$f18(A)).
% 1.79/1.95 ** KEPT (pick-wt=7): 41 [copy,40,flip.2] r1($f17(A))|$f18(A)=A.
% 1.79/1.95 ** KEPT (pick-wt=9): 43 [copy,42,flip.1] $f17(A)=A|r2($f19(A),$f18(A)).
% 1.79/1.95 ** KEPT (pick-wt=8): 45 [copy,44,flip.1,flip.2] $f17(A)=A|$f18(A)=A.
% 1.79/1.95 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] A=A.
% 1.79/1.95 15 back subsumes 14.
% 1.79/1.95 >>>> Starting back demodulation with 20.
% 1.79/1.95 >>>> Starting back demodulation with 27.
% 1.79/1.95 >> back demodulating 25 with 27.
% 1.79/1.95 >>>> Starting back demodulation with 33.
% 1.79/1.95 >> back demodulating 31 with 33.
% 1.79/1.95 >>>> Starting back demodulation with 38.
% 1.79/1.95 >> back demodulating 35 with 38.
% 1.79/1.95
% 1.79/1.95 ======= end of input processing =======
% 1.79/1.95
% 1.79/1.95 =========== start of search ===========
% 1.79/1.95
% 1.79/1.95 -------- PROOF --------
% 1.79/1.95
% 1.79/1.95 -----> EMPTY CLAUSE at 0.00 sec ----> 121 [hyper,115,10,32,51] $F.
% 1.79/1.95
% 1.79/1.95 Length of proof is 4. Level of proof is 3.
% 1.79/1.95
% 1.79/1.95 ---------------- PROOF ----------------
% 1.79/1.95 % SZS status Theorem
% 1.79/1.95 % SZS output start Refutation
% See solution above
% 1.79/1.95 ------------ end of proof -------------
% 1.79/1.95
% 1.79/1.95
% 1.79/1.95 Search stopped by max_proofs option.
% 1.79/1.95
% 1.79/1.95
% 1.79/1.95 Search stopped by max_proofs option.
% 1.79/1.95
% 1.79/1.95 ============ end of search ============
% 1.79/1.95
% 1.79/1.95 -------------- statistics -------------
% 1.79/1.95 clauses given 17
% 1.79/1.95 clauses generated 106
% 1.79/1.95 clauses kept 96
% 1.79/1.95 clauses forward subsumed 64
% 1.79/1.95 clauses back subsumed 11
% 1.79/1.95 Kbytes malloced 976
% 1.79/1.95
% 1.79/1.95 ----------- times (seconds) -----------
% 1.79/1.95 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.79/1.95 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.79/1.95 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.79/1.95
% 1.79/1.95 That finishes the proof of the theorem.
% 1.79/1.95
% 1.79/1.95 Process 10381 finished Wed Jul 27 02:32:22 2022
% 1.79/1.95 Otter interrupted
% 1.79/1.95 PROOF FOUND
%------------------------------------------------------------------------------