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