TSTP Solution File: NUM843+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM843+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n014.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:04 EDT 2022
% Result : Theorem 2.39s 2.59s
% Output : Refutation 2.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 36 ( 19 unt; 5 nHn; 18 RR)
% Number of literals : 55 ( 31 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ greater(vd390,vd391),
file('NUM843+1.p',unknown),
[] ).
cnf(2,axiom,
~ le_q(vd390,vd391),
file('NUM843+1.p',unknown),
[] ).
cnf(12,axiom,
( A != B
| vplus(A,C) = vplus(B,C) ),
file('NUM843+1.p',unknown),
[] ).
cnf(21,axiom,
( le_q(A,B)
| ~ less(A,B) ),
file('NUM843+1.p',unknown),
[] ).
cnf(22,axiom,
( le_q(A,B)
| A != B ),
file('NUM843+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ less(A,B)
| greater(B,A) ),
file('NUM843+1.p',unknown),
[] ).
cnf(33,axiom,
( less(A,B)
| B != vplus(A,C) ),
file('NUM843+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ greater(A,B)
| A = vplus(B,dollar_f2(B,A)) ),
file('NUM843+1.p',unknown),
[] ).
cnf(35,plain,
( ~ greater(A,B)
| vplus(B,dollar_f2(B,A)) = A ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[34])]),
[iquote('copy,34,flip.2')] ).
cnf(38,axiom,
( A != vplus(B,C)
| B != vplus(A,D) ),
file('NUM843+1.p',unknown),
[] ).
cnf(40,axiom,
( A = B
| vplus(C,A) != vplus(C,B) ),
file('NUM843+1.p',unknown),
[] ).
cnf(48,plain,
vplus(A,B) != A,
inference(flip,[status(thm),theory(equality)],[inference(factor,[status(thm)],[38])]),
[iquote('factor,38.1.2,flip.1')] ).
cnf(49,axiom,
A = A,
file('NUM843+1.p',unknown),
[] ).
cnf(52,axiom,
greater(vplus(A,B),A),
file('NUM843+1.p',unknown),
[] ).
cnf(53,axiom,
( A = B
| greater(A,B)
| less(A,B) ),
file('NUM843+1.p',unknown),
[] ).
cnf(56,axiom,
vplus(A,B) = vplus(B,A),
file('NUM843+1.p',unknown),
[] ).
cnf(60,axiom,
vplus(v1,A) = vsucc(A),
file('NUM843+1.p',unknown),
[] ).
cnf(62,plain,
vsucc(A) = vplus(v1,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[60])]),
[iquote('copy,60,flip.1')] ).
cnf(67,axiom,
( A = v1
| A = vsucc(vskolem2(A)) ),
file('NUM843+1.p',unknown),
[] ).
cnf(68,plain,
( A = v1
| vplus(v1,vskolem2(A)) = A ),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[67]),62])]),
[iquote('copy,67,demod,62,flip.2')] ).
cnf(70,plain,
less(A,vplus(A,B)),
inference(hyper,[status(thm)],[49,33]),
[iquote('hyper,49,33')] ).
cnf(72,plain,
le_q(A,A),
inference(hyper,[status(thm)],[49,22]),
[iquote('hyper,49,22')] ).
cnf(112,plain,
vplus(A,dollar_f2(A,vplus(A,B))) = vplus(A,B),
inference(hyper,[status(thm)],[52,35]),
[iquote('hyper,52,35')] ).
cnf(127,plain,
le_q(A,vplus(A,B)),
inference(hyper,[status(thm)],[70,21]),
[iquote('hyper,70,21')] ).
cnf(182,plain,
( A = B
| greater(A,B)
| greater(B,A) ),
inference(hyper,[status(thm)],[53,26]),
[iquote('hyper,53,26')] ).
cnf(256,plain,
( le_q(A,B)
| ~ greater(B,A) ),
inference(para_into,[status(thm),theory(equality)],[127,35]),
[iquote('para_into,127.1.2,35.2.1')] ).
cnf(917,plain,
vskolem2(vplus(v1,A)) = A,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[68,40]),48]),
[iquote('hyper,68,40,unit_del,48')] ).
cnf(1346,plain,
vskolem2(vplus(A,v1)) = A,
inference(para_into,[status(thm),theory(equality)],[917,56]),
[iquote('para_into,917.1.1.1,56.1.1')] ).
cnf(1379,plain,
( A = B
| B != A ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1346,12]),1346]),
[iquote('para_into,1345.1.1.1,12.2.1,demod,1346')] ).
cnf(1454,plain,
( ~ greater(A,vd391)
| A != vd390 ),
inference(para_from,[status(thm),theory(equality)],[1379,1]),
[iquote('para_from,1379.1.1,1.1.1')] ).
cnf(1561,plain,
dollar_f2(A,vplus(A,B)) = B,
inference(hyper,[status(thm)],[112,40]),
[iquote('hyper,112,40')] ).
cnf(1741,plain,
dollar_f2(A,vplus(B,A)) = B,
inference(para_into,[status(thm),theory(equality)],[1561,56]),
[iquote('para_into,1561.1.1.2,56.1.1')] ).
cnf(1819,plain,
( vd391 = vd390
| greater(vd391,vd390) ),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[182,1454,1741]),1741,1741])]),
[iquote('hyper,182,1454,1740,demod,1741,1741,flip.1')] ).
cnf(1821,plain,
vd391 = vd390,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[1819,256]),2]),
[iquote('hyper,1819,256,unit_del,2')] ).
cnf(1825,plain,
~ le_q(vd390,vd390),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[2]),1821]),
[iquote('back_demod,2,demod,1821')] ).
cnf(1826,plain,
$false,
inference(binary,[status(thm)],[1825,72]),
[iquote('binary,1825.1,72.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM843+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n014.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 09:54:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.85/2.05 ----- Otter 3.3f, August 2004 -----
% 1.85/2.05 The process was started by sandbox2 on n014.cluster.edu,
% 1.85/2.05 Wed Jul 27 09:54:54 2022
% 1.85/2.05 The command was "./otter". The process ID is 29121.
% 1.85/2.05
% 1.85/2.05 set(prolog_style_variables).
% 1.85/2.05 set(auto).
% 1.85/2.05 dependent: set(auto1).
% 1.85/2.05 dependent: set(process_input).
% 1.85/2.05 dependent: clear(print_kept).
% 1.85/2.05 dependent: clear(print_new_demod).
% 1.85/2.05 dependent: clear(print_back_demod).
% 1.85/2.05 dependent: clear(print_back_sub).
% 1.85/2.05 dependent: set(control_memory).
% 1.85/2.05 dependent: assign(max_mem, 12000).
% 1.85/2.05 dependent: assign(pick_given_ratio, 4).
% 1.85/2.05 dependent: assign(stats_level, 1).
% 1.85/2.05 dependent: assign(max_seconds, 10800).
% 1.85/2.05 clear(print_given).
% 1.85/2.05
% 1.85/2.05 formula_list(usable).
% 1.85/2.05 all A (A=A).
% 1.85/2.05 -greater(vd390,vd391).
% 1.85/2.05 -le_q(vd390,vd391).
% 1.85/2.05 less(vd390,vplus(vd391,v1)).
% 1.85/2.05 all Vd375 Vd376 (greater(Vd375,Vd376)->ge_q(Vd375,vplus(Vd376,v1))).
% 1.85/2.05 all Vd369 ge_q(Vd369,v1).
% 1.85/2.05 all Vd362 Vd363 Vd365 Vd366 (ge_q(Vd365,Vd366)&ge_q(Vd362,Vd363)->ge_q(vplus(Vd362,Vd365),vplus(Vd363,Vd366))).
% 1.85/2.05 all Vd353 Vd354 Vd355 Vd356 (greater(Vd355,Vd356)&ge_q(Vd353,Vd354)|ge_q(Vd355,Vd356)&greater(Vd353,Vd354)->greater(vplus(Vd353,Vd355),vplus(Vd354,Vd356))).
% 1.85/2.05 all Vd337 Vd338 Vd340 Vd341 (greater(Vd340,Vd341)&greater(Vd337,Vd338)->greater(vplus(Vd337,Vd340),vplus(Vd338,Vd341))).
% 1.85/2.05 all Vd328 Vd329 Vd330 (less(vplus(Vd328,Vd330),vplus(Vd329,Vd330))->less(Vd328,Vd329)).
% 1.85/2.05 all Vd328 Vd329 Vd330 (vplus(Vd328,Vd330)=vplus(Vd329,Vd330)->Vd328=Vd329).
% 1.85/2.05 all Vd328 Vd329 Vd330 (greater(vplus(Vd328,Vd330),vplus(Vd329,Vd330))->greater(Vd328,Vd329)).
% 1.85/2.05 all Vd301 Vd302 Vd303 (less(Vd301,Vd302)->less(vplus(Vd301,Vd303),vplus(Vd302,Vd303))).
% 1.85/2.05 all Vd301 Vd302 Vd303 (Vd301=Vd302->vplus(Vd301,Vd303)=vplus(Vd302,Vd303)).
% 1.85/2.05 all Vd301 Vd302 Vd303 (greater(Vd301,Vd302)->greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303))).
% 1.85/2.05 all Vd295 Vd296 greater(vplus(Vd295,Vd296),Vd295).
% 1.85/2.05 all Vd289 Vd290 Vd292 (le_q(Vd290,Vd292)&le_q(Vd289,Vd290)->le_q(Vd289,Vd292)).
% 1.85/2.05 all Vd281 Vd282 Vd283 (less(Vd282,Vd283)&le_q(Vd281,Vd282)|le_q(Vd282,Vd283)&less(Vd281,Vd282)->less(Vd281,Vd283)).
% 1.85/2.05 all Vd262 Vd263 Vd265 (less(Vd263,Vd265)&less(Vd262,Vd263)->less(Vd262,Vd265)).
% 1.85/2.05 all Vd258 Vd259 (le_q(Vd258,Vd259)->ge_q(Vd259,Vd258)).
% 1.85/2.05 all Vd254 Vd255 (ge_q(Vd254,Vd255)->le_q(Vd255,Vd254)).
% 1.85/2.05 all Vd249 Vd250 (le_q(Vd250,Vd249)<->less(Vd250,Vd249)|Vd250=Vd249).
% 1.85/2.05 all Vd244 Vd245 (ge_q(Vd245,Vd244)<->greater(Vd245,Vd244)|Vd245=Vd244).
% 1.85/2.05 all Vd226 Vd227 (less(Vd226,Vd227)->greater(Vd227,Vd226)).
% 1.85/2.05 all Vd208 Vd209 (greater(Vd208,Vd209)->less(Vd209,Vd208)).
% 1.85/2.05 all Vd203 Vd204 (Vd203=Vd204|greater(Vd203,Vd204)|less(Vd203,Vd204)).
% 1.85/2.05 all Vd203 Vd204 (Vd203!=Vd204| -less(Vd203,Vd204)).
% 1.85/2.05 all Vd203 Vd204 (-greater(Vd203,Vd204)| -less(Vd203,Vd204)).
% 1.85/2.05 all Vd203 Vd204 (Vd203!=Vd204| -greater(Vd203,Vd204)).
% 1.85/2.05 all Vd198 Vd199 (less(Vd199,Vd198)<-> (exists Vd201 (Vd198=vplus(Vd199,Vd201)))).
% 1.85/2.05 all Vd193 Vd194 (greater(Vd194,Vd193)<-> (exists Vd196 (Vd194=vplus(Vd193,Vd196)))).
% 1.85/2.05 all Vd120 Vd121 (Vd120=Vd121| (exists Vd123 (Vd120=vplus(Vd121,Vd123)))| (exists Vd125 (Vd121=vplus(Vd120,Vd125)))).
% 1.85/2.05 all Vd120 Vd121 (Vd120!=Vd121| -(exists Vd125 (Vd121=vplus(Vd120,Vd125)))).
% 1.85/2.05 all Vd120 Vd121 (-(exists Vd123 (Vd120=vplus(Vd121,Vd123)))| -(exists Vd125 (Vd121=vplus(Vd120,Vd125)))).
% 1.85/2.05 all Vd120 Vd121 (Vd120!=Vd121| -(exists Vd123 (Vd120=vplus(Vd121,Vd123)))).
% 1.85/2.05 all Vd104 Vd105 (Vd104!=Vd105-> (all Vd107 (vplus(Vd107,Vd104)!=vplus(Vd107,Vd105)))).
% 1.85/2.05 all Vd92 Vd93 (Vd93!=vplus(Vd92,Vd93)).
% 1.85/2.05 all Vd78 Vd79 (vplus(Vd79,Vd78)=vplus(Vd78,Vd79)).
% 1.85/2.05 all Vd68 Vd69 (vplus(vsucc(Vd68),Vd69)=vsucc(vplus(Vd68,Vd69))).
% 1.85/2.05 all Vd59 (vplus(v1,Vd59)=vsucc(Vd59)).
% 1.85/2.05 all Vd46 Vd47 Vd48 (vplus(vplus(Vd46,Vd47),Vd48)=vplus(Vd46,vplus(Vd47,Vd48))).
% 1.85/2.05 all Vd42 Vd43 (vplus(Vd42,vsucc(Vd43))=vsucc(vplus(Vd42,Vd43))&vplus(Vd42,v1)=vsucc(Vd42)).
% 1.85/2.05 all Vd24 (Vd24!=v1->Vd24=vsucc(vskolem2(Vd24))).
% 1.85/2.05 all Vd16 (vsucc(Vd16)!=Vd16).
% 1.85/2.05 all Vd7 Vd8 (Vd7!=Vd8->vsucc(Vd7)!=vsucc(Vd8)).
% 1.85/2.05 all Vd3 Vd4 (vsucc(Vd3)=vsucc(Vd4)->Vd3=Vd4).
% 1.85/2.05 all Vd1 (vsucc(Vd1)!=v1).
% 1.85/2.05 end_of_list.
% 1.85/2.05
% 1.85/2.05 -------> usable clausifies to:
% 1.85/2.05
% 1.85/2.05 list(usable).
% 1.85/2.05 0 [] A=A.
% 1.85/2.05 0 [] -greater(vd390,vd391).
% 1.85/2.05 0 [] -le_q(vd390,vd391).
% 1.85/2.05 0 [] less(vd390,vplus(vd391,v1)).
% 1.85/2.05 0 [] -greater(Vd375,Vd376)|ge_q(Vd375,vplus(Vd376,v1)).
% 1.85/2.05 0 [] ge_q(Vd369,v1).
% 1.85/2.05 0 [] -ge_q(Vd365,Vd366)| -ge_q(Vd362,Vd363)|ge_q(vplus(Vd362,Vd365),vplus(Vd363,Vd366)).
% 1.85/2.05 0 [] -greater(Vd355,Vd356)| -ge_q(Vd353,Vd354)|greater(vplus(Vd353,Vd355),vplus(Vd354,Vd356)).
% 1.85/2.05 0 [] -ge_q(Vd355,Vd356)| -greater(Vd353,Vd354)|greater(vplus(Vd353,Vd355),vplus(Vd354,Vd356)).
% 1.85/2.05 0 [] -greater(Vd340,Vd341)| -greater(Vd337,Vd338)|greater(vplus(Vd337,Vd340),vplus(Vd338,Vd341)).
% 1.85/2.05 0 [] -less(vplus(Vd328,Vd330),vplus(Vd329,Vd330))|less(Vd328,Vd329).
% 1.85/2.05 0 [] vplus(Vd328,Vd330)!=vplus(Vd329,Vd330)|Vd328=Vd329.
% 1.85/2.05 0 [] -greater(vplus(Vd328,Vd330),vplus(Vd329,Vd330))|greater(Vd328,Vd329).
% 1.85/2.05 0 [] -less(Vd301,Vd302)|less(vplus(Vd301,Vd303),vplus(Vd302,Vd303)).
% 1.85/2.05 0 [] Vd301!=Vd302|vplus(Vd301,Vd303)=vplus(Vd302,Vd303).
% 1.85/2.05 0 [] -greater(Vd301,Vd302)|greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303)).
% 1.85/2.05 0 [] greater(vplus(Vd295,Vd296),Vd295).
% 1.85/2.05 0 [] -le_q(Vd290,Vd292)| -le_q(Vd289,Vd290)|le_q(Vd289,Vd292).
% 1.85/2.05 0 [] -less(Vd282,Vd283)| -le_q(Vd281,Vd282)|less(Vd281,Vd283).
% 1.85/2.05 0 [] -le_q(Vd282,Vd283)| -less(Vd281,Vd282)|less(Vd281,Vd283).
% 1.85/2.05 0 [] -less(Vd263,Vd265)| -less(Vd262,Vd263)|less(Vd262,Vd265).
% 1.85/2.05 0 [] -le_q(Vd258,Vd259)|ge_q(Vd259,Vd258).
% 1.85/2.05 0 [] -ge_q(Vd254,Vd255)|le_q(Vd255,Vd254).
% 1.85/2.05 0 [] -le_q(Vd250,Vd249)|less(Vd250,Vd249)|Vd250=Vd249.
% 1.85/2.05 0 [] le_q(Vd250,Vd249)| -less(Vd250,Vd249).
% 1.85/2.05 0 [] le_q(Vd250,Vd249)|Vd250!=Vd249.
% 1.85/2.05 0 [] -ge_q(Vd245,Vd244)|greater(Vd245,Vd244)|Vd245=Vd244.
% 1.85/2.05 0 [] ge_q(Vd245,Vd244)| -greater(Vd245,Vd244).
% 1.85/2.05 0 [] ge_q(Vd245,Vd244)|Vd245!=Vd244.
% 1.85/2.05 0 [] -less(Vd226,Vd227)|greater(Vd227,Vd226).
% 1.85/2.05 0 [] -greater(Vd208,Vd209)|less(Vd209,Vd208).
% 1.85/2.05 0 [] Vd203=Vd204|greater(Vd203,Vd204)|less(Vd203,Vd204).
% 1.85/2.05 0 [] Vd203!=Vd204| -less(Vd203,Vd204).
% 1.85/2.05 0 [] -greater(Vd203,Vd204)| -less(Vd203,Vd204).
% 1.85/2.05 0 [] Vd203!=Vd204| -greater(Vd203,Vd204).
% 1.85/2.05 0 [] -less(Vd199,Vd198)|Vd198=vplus(Vd199,$f1(Vd198,Vd199)).
% 1.85/2.05 0 [] less(Vd199,Vd198)|Vd198!=vplus(Vd199,Vd201).
% 1.85/2.05 0 [] -greater(Vd194,Vd193)|Vd194=vplus(Vd193,$f2(Vd193,Vd194)).
% 1.85/2.05 0 [] greater(Vd194,Vd193)|Vd194!=vplus(Vd193,Vd196).
% 1.85/2.05 0 [] Vd120=Vd121|Vd120=vplus(Vd121,$f3(Vd120,Vd121))|Vd121=vplus(Vd120,$f4(Vd120,Vd121)).
% 1.85/2.05 0 [] Vd120!=Vd121|Vd121!=vplus(Vd120,Vd125).
% 1.85/2.05 0 [] Vd120!=vplus(Vd121,Vd123)|Vd121!=vplus(Vd120,Vd125).
% 1.85/2.05 0 [] Vd120!=Vd121|Vd120!=vplus(Vd121,Vd123).
% 1.85/2.05 0 [] Vd104=Vd105|vplus(Vd107,Vd104)!=vplus(Vd107,Vd105).
% 1.85/2.05 0 [] Vd93!=vplus(Vd92,Vd93).
% 1.85/2.05 0 [] vplus(Vd79,Vd78)=vplus(Vd78,Vd79).
% 1.85/2.05 0 [] vplus(vsucc(Vd68),Vd69)=vsucc(vplus(Vd68,Vd69)).
% 1.85/2.05 0 [] vplus(v1,Vd59)=vsucc(Vd59).
% 1.85/2.05 0 [] vplus(vplus(Vd46,Vd47),Vd48)=vplus(Vd46,vplus(Vd47,Vd48)).
% 1.85/2.05 0 [] vplus(Vd42,vsucc(Vd43))=vsucc(vplus(Vd42,Vd43)).
% 1.85/2.05 0 [] vplus(Vd42,v1)=vsucc(Vd42).
% 1.85/2.05 0 [] Vd24=v1|Vd24=vsucc(vskolem2(Vd24)).
% 1.85/2.05 0 [] vsucc(Vd16)!=Vd16.
% 1.85/2.05 0 [] Vd7=Vd8|vsucc(Vd7)!=vsucc(Vd8).
% 1.85/2.05 0 [] vsucc(Vd3)!=vsucc(Vd4)|Vd3=Vd4.
% 1.85/2.05 0 [] vsucc(Vd1)!=v1.
% 1.85/2.05 end_of_list.
% 1.85/2.05
% 1.85/2.05 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.85/2.05
% 1.85/2.05 This ia a non-Horn set with equality. The strategy will be
% 1.85/2.05 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.85/2.05 deletion, with positive clauses in sos and nonpositive
% 1.85/2.05 clauses in usable.
% 1.85/2.05
% 1.85/2.05 dependent: set(knuth_bendix).
% 1.85/2.05 dependent: set(anl_eq).
% 1.85/2.05 dependent: set(para_from).
% 1.85/2.05 dependent: set(para_into).
% 1.85/2.05 dependent: clear(para_from_right).
% 1.85/2.05 dependent: clear(para_into_right).
% 1.85/2.05 dependent: set(para_from_vars).
% 1.85/2.05 dependent: set(eq_units_both_ways).
% 1.85/2.05 dependent: set(dynamic_demod_all).
% 1.85/2.05 dependent: set(dynamic_demod).
% 1.85/2.05 dependent: set(order_eq).
% 1.85/2.05 dependent: set(back_demod).
% 1.85/2.05 dependent: set(lrpo).
% 1.85/2.05 dependent: set(hyper_res).
% 1.85/2.05 dependent: set(unit_deletion).
% 1.85/2.05 dependent: set(factor).
% 1.85/2.05
% 1.85/2.05 ------------> process usable:
% 1.85/2.05 ** KEPT (pick-wt=3): 1 [] -greater(vd390,vd391).
% 1.85/2.05 ** KEPT (pick-wt=3): 2 [] -le_q(vd390,vd391).
% 1.85/2.05 ** KEPT (pick-wt=8): 3 [] -greater(A,B)|ge_q(A,vplus(B,v1)).
% 1.85/2.05 ** KEPT (pick-wt=13): 4 [] -ge_q(A,B)| -ge_q(C,D)|ge_q(vplus(C,A),vplus(D,B)).
% 1.85/2.05 ** KEPT (pick-wt=13): 5 [] -greater(A,B)| -ge_q(C,D)|greater(vplus(C,A),vplus(D,B)).
% 1.85/2.05 ** KEPT (pick-wt=13): 6 [] -ge_q(A,B)| -greater(C,D)|greater(vplus(C,A),vplus(D,B)).
% 1.85/2.05 ** KEPT (pick-wt=13): 7 [] -greater(A,B)| -greater(C,D)|greater(vplus(C,A),vplus(D,B)).
% 1.85/2.05 ** KEPT (pick-wt=10): 8 [] -less(vplus(A,B),vplus(C,B))|less(A,C).
% 1.85/2.05 ** KEPT (pick-wt=10): 9 [] vplus(A,B)!=vplus(C,B)|A=C.
% 2.39/2.59 ** KEPT (pick-wt=10): 10 [] -greater(vplus(A,B),vplus(C,B))|greater(A,C).
% 2.39/2.59 ** KEPT (pick-wt=10): 11 [] -less(A,B)|less(vplus(A,C),vplus(B,C)).
% 2.39/2.59 ** KEPT (pick-wt=10): 12 [] A!=B|vplus(A,C)=vplus(B,C).
% 2.39/2.59 ** KEPT (pick-wt=10): 13 [] -greater(A,B)|greater(vplus(A,C),vplus(B,C)).
% 2.39/2.59 ** KEPT (pick-wt=9): 14 [] -le_q(A,B)| -le_q(C,A)|le_q(C,B).
% 2.39/2.59 ** KEPT (pick-wt=9): 15 [] -less(A,B)| -le_q(C,A)|less(C,B).
% 2.39/2.59 ** KEPT (pick-wt=9): 16 [] -le_q(A,B)| -less(C,A)|less(C,B).
% 2.39/2.59 ** KEPT (pick-wt=9): 17 [] -less(A,B)| -less(C,A)|less(C,B).
% 2.39/2.59 ** KEPT (pick-wt=6): 18 [] -le_q(A,B)|ge_q(B,A).
% 2.39/2.59 ** KEPT (pick-wt=6): 19 [] -ge_q(A,B)|le_q(B,A).
% 2.39/2.59 ** KEPT (pick-wt=9): 20 [] -le_q(A,B)|less(A,B)|A=B.
% 2.39/2.59 ** KEPT (pick-wt=6): 21 [] le_q(A,B)| -less(A,B).
% 2.39/2.59 ** KEPT (pick-wt=6): 22 [] le_q(A,B)|A!=B.
% 2.39/2.59 ** KEPT (pick-wt=9): 23 [] -ge_q(A,B)|greater(A,B)|A=B.
% 2.39/2.59 ** KEPT (pick-wt=6): 24 [] ge_q(A,B)| -greater(A,B).
% 2.39/2.59 ** KEPT (pick-wt=6): 25 [] ge_q(A,B)|A!=B.
% 2.39/2.59 ** KEPT (pick-wt=6): 26 [] -less(A,B)|greater(B,A).
% 2.39/2.59 ** KEPT (pick-wt=6): 27 [] -greater(A,B)|less(B,A).
% 2.39/2.59 ** KEPT (pick-wt=6): 28 [] A!=B| -less(A,B).
% 2.39/2.59 ** KEPT (pick-wt=6): 29 [] -greater(A,B)| -less(A,B).
% 2.39/2.59 ** KEPT (pick-wt=6): 30 [] A!=B| -greater(A,B).
% 2.39/2.59 ** KEPT (pick-wt=10): 32 [copy,31,flip.2] -less(A,B)|vplus(A,$f1(B,A))=B.
% 2.39/2.59 ** KEPT (pick-wt=8): 33 [] less(A,B)|B!=vplus(A,C).
% 2.39/2.59 ** KEPT (pick-wt=10): 35 [copy,34,flip.2] -greater(A,B)|vplus(B,$f2(B,A))=A.
% 2.39/2.59 ** KEPT (pick-wt=8): 36 [] greater(A,B)|A!=vplus(B,C).
% 2.39/2.59 ** KEPT (pick-wt=8): 37 [] A!=B|B!=vplus(A,C).
% 2.39/2.59 ** KEPT (pick-wt=10): 38 [] A!=vplus(B,C)|B!=vplus(A,D).
% 2.39/2.59 ** KEPT (pick-wt=8): 39 [] A!=B|A!=vplus(B,C).
% 2.39/2.59 ** KEPT (pick-wt=10): 40 [] A=B|vplus(C,A)!=vplus(C,B).
% 2.39/2.59 ** KEPT (pick-wt=5): 42 [copy,41,flip.1] vplus(A,B)!=B.
% 2.39/2.59 ** KEPT (pick-wt=4): 43 [] vsucc(A)!=A.
% 2.39/2.59 ** KEPT (pick-wt=8): 44 [] A=B|vsucc(A)!=vsucc(B).
% 2.39/2.59 Following clause subsumed by 44 during input processing: 0 [] vsucc(A)!=vsucc(B)|A=B.
% 2.39/2.59 ** KEPT (pick-wt=4): 45 [] vsucc(A)!=v1.
% 2.39/2.59
% 2.39/2.59 ------------> process sos:
% 2.39/2.59 ** KEPT (pick-wt=3): 49 [] A=A.
% 2.39/2.59 ** KEPT (pick-wt=5): 50 [] less(vd390,vplus(vd391,v1)).
% 2.39/2.59 ** KEPT (pick-wt=3): 51 [] ge_q(A,v1).
% 2.39/2.59 ** KEPT (pick-wt=5): 52 [] greater(vplus(A,B),A).
% 2.39/2.59 ** KEPT (pick-wt=9): 53 [] A=B|greater(A,B)|less(A,B).
% 2.39/2.59 ** KEPT (pick-wt=17): 55 [copy,54,flip.2,flip.3] A=B|vplus(B,$f3(A,B))=A|vplus(A,$f4(A,B))=B.
% 2.39/2.59 ** KEPT (pick-wt=7): 56 [] vplus(A,B)=vplus(B,A).
% 2.39/2.59 ** KEPT (pick-wt=9): 58 [copy,57,flip.1] vsucc(vplus(A,B))=vplus(vsucc(A),B).
% 2.39/2.59 ---> New Demodulator: 59 [new_demod,58] vsucc(vplus(A,B))=vplus(vsucc(A),B).
% 2.39/2.59 ** KEPT (pick-wt=6): 61 [copy,60,flip.1] vsucc(A)=vplus(v1,A).
% 2.39/2.59 ---> New Demodulator: 62 [new_demod,61] vsucc(A)=vplus(v1,A).
% 2.39/2.59 ** KEPT (pick-wt=11): 63 [] vplus(vplus(A,B),C)=vplus(A,vplus(B,C)).
% 2.39/2.59 ---> New Demodulator: 64 [new_demod,63] vplus(vplus(A,B),C)=vplus(A,vplus(B,C)).
% 2.39/2.59 ** KEPT (pick-wt=11): 66 [copy,65,demod,62,62] vplus(A,vplus(v1,B))=vplus(v1,vplus(A,B)).
% 2.39/2.59 Following clause subsumed by 56 during input processing: 0 [demod,62] vplus(A,v1)=vplus(v1,A).
% 2.39/2.59 ** KEPT (pick-wt=9): 68 [copy,67,demod,62,flip.2] A=v1|vplus(v1,vskolem2(A))=A.
% 2.39/2.59 Following clause subsumed by 49 during input processing: 0 [copy,49,flip.1] A=A.
% 2.39/2.59 Following clause subsumed by 56 during input processing: 0 [copy,56,flip.1] vplus(A,B)=vplus(B,A).
% 2.39/2.59 >>>> Starting back demodulation with 59.
% 2.39/2.59 >>>> Starting back demodulation with 62.
% 2.39/2.59 >> back demodulating 58 with 62.
% 2.39/2.59 >> back demodulating 45 with 62.
% 2.39/2.59 >> back demodulating 44 with 62.
% 2.39/2.59 >> back demodulating 43 with 62.
% 2.39/2.59 >>>> Starting back demodulation with 64.
% 2.39/2.59 ** KEPT (pick-wt=11): 69 [copy,66,flip.1] vplus(v1,vplus(A,B))=vplus(A,vplus(v1,B)).
% 2.39/2.59 Following clause subsumed by 66 during input processing: 0 [copy,69,flip.1] vplus(A,vplus(v1,B))=vplus(v1,vplus(A,B)).
% 2.39/2.59
% 2.39/2.59 ======= end of input processing =======
% 2.39/2.59
% 2.39/2.59 =========== start of search ===========
% 2.39/2.59
% 2.39/2.59
% 2.39/2.59 Resetting weight limit to 7.
% 2.39/2.59
% 2.39/2.59
% 2.39/2.59 Resetting weight limit to 7.
% 2.39/2.59
% 2.39/2.59 sos_size=1108
% 2.39/2.59
% 2.39/2.59 -------- PROOF --------
% 2.39/2.59
% 2.39/2.59 ----> UNIT CONFLICT at 0.54 sec ----> 1826 [binary,1825.1,72.1] $F.
% 2.39/2.59
% 2.39/2.59 Length of proof is 19. Level of proof is 9.
% 2.39/2.59
% 2.39/2.59 ---------------- PROOF ----------------
% 2.39/2.59 % SZS status Theorem
% 2.39/2.59 % SZS output start Refutation
% See solution above
% 2.44/2.59 ------------ end of proof -------------
% 2.44/2.59
% 2.44/2.59
% 2.44/2.59 Search stopped by max_proofs option.
% 2.44/2.59
% 2.44/2.59
% 2.44/2.59 Search stopped by max_proofs option.
% 2.44/2.59
% 2.44/2.59 ============ end of search ============
% 2.44/2.59
% 2.44/2.59 -------------- statistics -------------
% 2.44/2.59 clauses given 442
% 2.44/2.59 clauses generated 52957
% 2.44/2.59 clauses kept 1746
% 2.44/2.59 clauses forward subsumed 7030
% 2.44/2.59 clauses back subsumed 194
% 2.44/2.59 Kbytes malloced 4882
% 2.44/2.59
% 2.44/2.59 ----------- times (seconds) -----------
% 2.44/2.59 user CPU time 0.54 (0 hr, 0 min, 0 sec)
% 2.44/2.59 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.44/2.59 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.44/2.59
% 2.44/2.59 That finishes the proof of the theorem.
% 2.44/2.59
% 2.44/2.59 Process 29121 finished Wed Jul 27 09:54:56 2022
% 2.44/2.59 Otter interrupted
% 2.44/2.59 PROOF FOUND
%------------------------------------------------------------------------------