TSTP Solution File: NUM839+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM839+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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.28s 2.49s
% Output : Refutation 2.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 21
% Syntax : Number of clauses : 49 ( 25 unt; 8 nHn; 27 RR)
% Number of literals : 77 ( 40 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 77 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ greater(vd328,vd329),
file('NUM839+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ less(A,B)
| less(vplus(A,C),vplus(B,C)) ),
file('NUM839+1.p',unknown),
[] ).
cnf(3,axiom,
( A != B
| vplus(A,C) = vplus(B,C) ),
file('NUM839+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ greater(A,B)
| greater(vplus(A,C),vplus(B,C)) ),
file('NUM839+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ ge_q(A,B)
| greater(A,B)
| A = B ),
file('NUM839+1.p',unknown),
[] ).
cnf(15,axiom,
( ge_q(A,B)
| ~ greater(A,B) ),
file('NUM839+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ greater(A,B)
| less(B,A) ),
file('NUM839+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ greater(A,B)
| ~ less(A,B) ),
file('NUM839+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ less(A,B)
| B = vplus(A,dollar_f1(B,A)) ),
file('NUM839+1.p',unknown),
[] ).
cnf(23,plain,
( ~ less(A,B)
| vplus(A,dollar_f1(B,A)) = B ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[22])]),
[iquote('copy,22,flip.2')] ).
cnf(24,axiom,
( less(A,B)
| B != vplus(A,C) ),
file('NUM839+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ greater(A,B)
| A = vplus(B,dollar_f2(B,A)) ),
file('NUM839+1.p',unknown),
[] ).
cnf(26,plain,
( ~ greater(A,B)
| vplus(B,dollar_f2(B,A)) = A ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[25])]),
[iquote('copy,25,flip.2')] ).
cnf(29,axiom,
( A != vplus(B,C)
| B != vplus(A,D) ),
file('NUM839+1.p',unknown),
[] ).
cnf(31,axiom,
( A = B
| vplus(C,A) != vplus(C,B) ),
file('NUM839+1.p',unknown),
[] ).
cnf(37,plain,
vplus(A,B) != A,
inference(flip,[status(thm),theory(equality)],[inference(factor,[status(thm)],[29])]),
[iquote('factor,29.1.2,flip.1')] ).
cnf(38,axiom,
A = A,
file('NUM839+1.p',unknown),
[] ).
cnf(39,axiom,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
file('NUM839+1.p',unknown),
[] ).
cnf(40,axiom,
greater(vplus(A,B),A),
file('NUM839+1.p',unknown),
[] ).
cnf(41,axiom,
( A = B
| greater(A,B)
| less(A,B) ),
file('NUM839+1.p',unknown),
[] ).
cnf(44,axiom,
vplus(A,B) = vplus(B,A),
file('NUM839+1.p',unknown),
[] ).
cnf(48,axiom,
vplus(v1,A) = vsucc(A),
file('NUM839+1.p',unknown),
[] ).
cnf(50,plain,
vsucc(A) = vplus(v1,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[48])]),
[iquote('copy,48,flip.1')] ).
cnf(52,axiom,
vplus(vplus(A,B),C) = vplus(A,vplus(B,C)),
file('NUM839+1.p',unknown),
[] ).
cnf(55,axiom,
( A = v1
| A = vsucc(vskolem2(A)) ),
file('NUM839+1.p',unknown),
[] ).
cnf(56,plain,
( A = v1
| vplus(v1,vskolem2(A)) = A ),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[55]),50])]),
[iquote('copy,55,demod,50,flip.2')] ).
cnf(58,plain,
less(A,vplus(A,B)),
inference(hyper,[status(thm)],[38,24]),
[iquote('hyper,38,24')] ).
cnf(63,plain,
ge_q(vplus(A,B),A),
inference(hyper,[status(thm)],[40,15]),
[iquote('hyper,40,15')] ).
cnf(69,plain,
vplus(A,dollar_f1(vplus(A,B),A)) = vplus(A,B),
inference(hyper,[status(thm)],[58,23]),
[iquote('hyper,58,23')] ).
cnf(77,plain,
vplus(vd329,vplus(vd330,dollar_f2(vplus(vd329,vd330),vplus(vd328,vd330)))) = vplus(vd328,vd330),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[39,26]),52]),
[iquote('hyper,39,26,demod,52')] ).
cnf(81,plain,
greater(vplus(vd328,vplus(vd330,A)),vplus(vd329,vplus(vd330,A))),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[39,4]),52,52]),
[iquote('hyper,39,4,demod,52,52')] ).
cnf(103,plain,
( ge_q(A,B)
| ~ less(B,A) ),
inference(para_into,[status(thm),theory(equality)],[63,23]),
[iquote('para_into,63.1.1,23.2.1')] ).
cnf(115,plain,
( A = B
| greater(A,B)
| ge_q(B,A) ),
inference(hyper,[status(thm)],[41,103]),
[iquote('hyper,41,103')] ).
cnf(122,plain,
( A = B
| greater(A,B)
| less(vplus(A,C),vplus(B,C)) ),
inference(hyper,[status(thm)],[41,2]),
[iquote('hyper,41,2')] ).
cnf(437,plain,
vplus(A,vplus(B,C)) != vplus(A,B),
inference(para_from,[status(thm),theory(equality)],[52,37]),
[iquote('para_from,51.1.1,37.1.1')] ).
cnf(557,plain,
vskolem2(vplus(v1,A)) = A,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[56,31]),37]),
[iquote('hyper,56,31,unit_del,37')] ).
cnf(749,plain,
vskolem2(vplus(A,v1)) = A,
inference(para_into,[status(thm),theory(equality)],[557,44]),
[iquote('para_into,557.1.1.1,44.1.1')] ).
cnf(1026,plain,
( A = B
| B != A ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[749,3]),749]),
[iquote('para_into,748.1.1.1,3.2.1,demod,749')] ).
cnf(1075,plain,
( ~ greater(A,vd329)
| A != vd328 ),
inference(para_from,[status(thm),theory(equality)],[1026,1]),
[iquote('para_from,1026.1.1,1.1.1')] ).
cnf(1121,plain,
dollar_f1(vplus(A,B),A) = B,
inference(hyper,[status(thm)],[69,31]),
[iquote('hyper,69,31')] ).
cnf(1221,plain,
dollar_f1(vplus(A,B),B) = A,
inference(para_into,[status(thm),theory(equality)],[1121,44]),
[iquote('para_into,1121.1.1.1,44.1.1')] ).
cnf(1402,plain,
( vd329 = vd328
| ge_q(vd329,vd328) ),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[115,1075,1221]),1221,1221])]),
[iquote('hyper,115,1075,1220,demod,1221,1221,flip.1')] ).
cnf(1403,plain,
( vd329 = vd328
| greater(vd329,vd328) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[1402,14])]),
[iquote('hyper,1402,14,factor_simp')] ).
cnf(1604,plain,
greater(vd329,vd328),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[1403,77]),437]),
[iquote('para_from,1403.1.1,77.1.1.1,unit_del,437')] ).
cnf(1611,plain,
less(vd328,vd329),
inference(hyper,[status(thm)],[1604,18]),
[iquote('hyper,1604,18')] ).
cnf(1631,plain,
vplus(vd328,dollar_f1(vd329,vd328)) = vd329,
inference(hyper,[status(thm)],[1611,23]),
[iquote('hyper,1611,23')] ).
cnf(1703,plain,
vd329 = vd328,
inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[122,20,81]),1])]),
[iquote('hyper,122,20,81,unit_del,1,flip.1')] ).
cnf(1765,plain,
vplus(vd328,dollar_f1(vd328,vd328)) = vd328,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1631]),1703,1703]),
[iquote('back_demod,1631,demod,1703,1703')] ).
cnf(1767,plain,
$false,
inference(binary,[status(thm)],[1765,37]),
[iquote('binary,1765.1,37.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM839+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n024.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:46:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.83/2.05 ----- Otter 3.3f, August 2004 -----
% 1.83/2.05 The process was started by sandbox2 on n024.cluster.edu,
% 1.83/2.05 Wed Jul 27 09:46:55 2022
% 1.83/2.05 The command was "./otter". The process ID is 23904.
% 1.83/2.05
% 1.83/2.05 set(prolog_style_variables).
% 1.83/2.05 set(auto).
% 1.83/2.05 dependent: set(auto1).
% 1.83/2.05 dependent: set(process_input).
% 1.83/2.05 dependent: clear(print_kept).
% 1.83/2.05 dependent: clear(print_new_demod).
% 1.83/2.05 dependent: clear(print_back_demod).
% 1.83/2.05 dependent: clear(print_back_sub).
% 1.83/2.05 dependent: set(control_memory).
% 1.83/2.05 dependent: assign(max_mem, 12000).
% 1.83/2.05 dependent: assign(pick_given_ratio, 4).
% 1.83/2.05 dependent: assign(stats_level, 1).
% 1.83/2.05 dependent: assign(max_seconds, 10800).
% 1.83/2.05 clear(print_given).
% 1.83/2.05
% 1.83/2.05 formula_list(usable).
% 1.83/2.05 all A (A=A).
% 1.83/2.05 -greater(vd328,vd329).
% 1.83/2.05 greater(vplus(vd328,vd330),vplus(vd329,vd330)).
% 1.83/2.05 all Vd301 Vd302 Vd303 (less(Vd301,Vd302)->less(vplus(Vd301,Vd303),vplus(Vd302,Vd303))).
% 1.83/2.05 all Vd301 Vd302 Vd303 (Vd301=Vd302->vplus(Vd301,Vd303)=vplus(Vd302,Vd303)).
% 1.83/2.05 all Vd301 Vd302 Vd303 (greater(Vd301,Vd302)->greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303))).
% 1.83/2.05 all Vd295 Vd296 greater(vplus(Vd295,Vd296),Vd295).
% 1.83/2.05 all Vd289 Vd290 Vd292 (le_q(Vd290,Vd292)&le_q(Vd289,Vd290)->le_q(Vd289,Vd292)).
% 1.83/2.05 all Vd281 Vd282 Vd283 (less(Vd282,Vd283)&le_q(Vd281,Vd282)|le_q(Vd282,Vd283)&less(Vd281,Vd282)->less(Vd281,Vd283)).
% 1.83/2.05 all Vd262 Vd263 Vd265 (less(Vd263,Vd265)&less(Vd262,Vd263)->less(Vd262,Vd265)).
% 1.83/2.05 all Vd258 Vd259 (le_q(Vd258,Vd259)->ge_q(Vd259,Vd258)).
% 1.83/2.05 all Vd254 Vd255 (ge_q(Vd254,Vd255)->le_q(Vd255,Vd254)).
% 1.83/2.05 all Vd249 Vd250 (le_q(Vd250,Vd249)<->less(Vd250,Vd249)|Vd250=Vd249).
% 1.83/2.05 all Vd244 Vd245 (ge_q(Vd245,Vd244)<->greater(Vd245,Vd244)|Vd245=Vd244).
% 1.83/2.05 all Vd226 Vd227 (less(Vd226,Vd227)->greater(Vd227,Vd226)).
% 1.83/2.05 all Vd208 Vd209 (greater(Vd208,Vd209)->less(Vd209,Vd208)).
% 1.83/2.05 all Vd203 Vd204 (Vd203=Vd204|greater(Vd203,Vd204)|less(Vd203,Vd204)).
% 1.83/2.05 all Vd203 Vd204 (Vd203!=Vd204| -less(Vd203,Vd204)).
% 1.83/2.05 all Vd203 Vd204 (-greater(Vd203,Vd204)| -less(Vd203,Vd204)).
% 1.83/2.05 all Vd203 Vd204 (Vd203!=Vd204| -greater(Vd203,Vd204)).
% 1.83/2.05 all Vd198 Vd199 (less(Vd199,Vd198)<-> (exists Vd201 (Vd198=vplus(Vd199,Vd201)))).
% 1.83/2.05 all Vd193 Vd194 (greater(Vd194,Vd193)<-> (exists Vd196 (Vd194=vplus(Vd193,Vd196)))).
% 1.83/2.05 all Vd120 Vd121 (Vd120=Vd121| (exists Vd123 (Vd120=vplus(Vd121,Vd123)))| (exists Vd125 (Vd121=vplus(Vd120,Vd125)))).
% 1.83/2.05 all Vd120 Vd121 (Vd120!=Vd121| -(exists Vd125 (Vd121=vplus(Vd120,Vd125)))).
% 1.83/2.05 all Vd120 Vd121 (-(exists Vd123 (Vd120=vplus(Vd121,Vd123)))| -(exists Vd125 (Vd121=vplus(Vd120,Vd125)))).
% 1.83/2.05 all Vd120 Vd121 (Vd120!=Vd121| -(exists Vd123 (Vd120=vplus(Vd121,Vd123)))).
% 1.83/2.05 all Vd104 Vd105 (Vd104!=Vd105-> (all Vd107 (vplus(Vd107,Vd104)!=vplus(Vd107,Vd105)))).
% 1.83/2.05 all Vd92 Vd93 (Vd93!=vplus(Vd92,Vd93)).
% 1.83/2.05 all Vd78 Vd79 (vplus(Vd79,Vd78)=vplus(Vd78,Vd79)).
% 1.83/2.05 all Vd68 Vd69 (vplus(vsucc(Vd68),Vd69)=vsucc(vplus(Vd68,Vd69))).
% 1.83/2.05 all Vd59 (vplus(v1,Vd59)=vsucc(Vd59)).
% 1.83/2.05 all Vd46 Vd47 Vd48 (vplus(vplus(Vd46,Vd47),Vd48)=vplus(Vd46,vplus(Vd47,Vd48))).
% 1.83/2.05 all Vd42 Vd43 (vplus(Vd42,vsucc(Vd43))=vsucc(vplus(Vd42,Vd43))&vplus(Vd42,v1)=vsucc(Vd42)).
% 1.83/2.05 all Vd24 (Vd24!=v1->Vd24=vsucc(vskolem2(Vd24))).
% 1.83/2.05 all Vd16 (vsucc(Vd16)!=Vd16).
% 1.83/2.05 all Vd7 Vd8 (Vd7!=Vd8->vsucc(Vd7)!=vsucc(Vd8)).
% 1.83/2.05 all Vd3 Vd4 (vsucc(Vd3)=vsucc(Vd4)->Vd3=Vd4).
% 1.83/2.05 all Vd1 (vsucc(Vd1)!=v1).
% 1.83/2.05 end_of_list.
% 1.83/2.05
% 1.83/2.05 -------> usable clausifies to:
% 1.83/2.05
% 1.83/2.05 list(usable).
% 1.83/2.05 0 [] A=A.
% 1.83/2.05 0 [] -greater(vd328,vd329).
% 1.83/2.05 0 [] greater(vplus(vd328,vd330),vplus(vd329,vd330)).
% 1.83/2.05 0 [] -less(Vd301,Vd302)|less(vplus(Vd301,Vd303),vplus(Vd302,Vd303)).
% 1.83/2.05 0 [] Vd301!=Vd302|vplus(Vd301,Vd303)=vplus(Vd302,Vd303).
% 1.83/2.05 0 [] -greater(Vd301,Vd302)|greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303)).
% 1.83/2.05 0 [] greater(vplus(Vd295,Vd296),Vd295).
% 1.83/2.05 0 [] -le_q(Vd290,Vd292)| -le_q(Vd289,Vd290)|le_q(Vd289,Vd292).
% 1.83/2.05 0 [] -less(Vd282,Vd283)| -le_q(Vd281,Vd282)|less(Vd281,Vd283).
% 1.83/2.05 0 [] -le_q(Vd282,Vd283)| -less(Vd281,Vd282)|less(Vd281,Vd283).
% 1.83/2.05 0 [] -less(Vd263,Vd265)| -less(Vd262,Vd263)|less(Vd262,Vd265).
% 1.83/2.05 0 [] -le_q(Vd258,Vd259)|ge_q(Vd259,Vd258).
% 1.83/2.05 0 [] -ge_q(Vd254,Vd255)|le_q(Vd255,Vd254).
% 1.83/2.05 0 [] -le_q(Vd250,Vd249)|less(Vd250,Vd249)|Vd250=Vd249.
% 1.83/2.05 0 [] le_q(Vd250,Vd249)| -less(Vd250,Vd249).
% 1.83/2.05 0 [] le_q(Vd250,Vd249)|Vd250!=Vd249.
% 1.83/2.05 0 [] -ge_q(Vd245,Vd244)|greater(Vd245,Vd244)|Vd245=Vd244.
% 1.83/2.05 0 [] ge_q(Vd245,Vd244)| -greater(Vd245,Vd244).
% 1.83/2.05 0 [] ge_q(Vd245,Vd244)|Vd245!=Vd244.
% 1.83/2.05 0 [] -less(Vd226,Vd227)|greater(Vd227,Vd226).
% 1.83/2.05 0 [] -greater(Vd208,Vd209)|less(Vd209,Vd208).
% 1.83/2.05 0 [] Vd203=Vd204|greater(Vd203,Vd204)|less(Vd203,Vd204).
% 1.83/2.05 0 [] Vd203!=Vd204| -less(Vd203,Vd204).
% 1.83/2.05 0 [] -greater(Vd203,Vd204)| -less(Vd203,Vd204).
% 1.83/2.05 0 [] Vd203!=Vd204| -greater(Vd203,Vd204).
% 1.83/2.05 0 [] -less(Vd199,Vd198)|Vd198=vplus(Vd199,$f1(Vd198,Vd199)).
% 1.83/2.05 0 [] less(Vd199,Vd198)|Vd198!=vplus(Vd199,Vd201).
% 1.83/2.05 0 [] -greater(Vd194,Vd193)|Vd194=vplus(Vd193,$f2(Vd193,Vd194)).
% 1.83/2.05 0 [] greater(Vd194,Vd193)|Vd194!=vplus(Vd193,Vd196).
% 1.83/2.05 0 [] Vd120=Vd121|Vd120=vplus(Vd121,$f3(Vd120,Vd121))|Vd121=vplus(Vd120,$f4(Vd120,Vd121)).
% 1.83/2.05 0 [] Vd120!=Vd121|Vd121!=vplus(Vd120,Vd125).
% 1.83/2.05 0 [] Vd120!=vplus(Vd121,Vd123)|Vd121!=vplus(Vd120,Vd125).
% 1.83/2.05 0 [] Vd120!=Vd121|Vd120!=vplus(Vd121,Vd123).
% 1.83/2.05 0 [] Vd104=Vd105|vplus(Vd107,Vd104)!=vplus(Vd107,Vd105).
% 1.83/2.05 0 [] Vd93!=vplus(Vd92,Vd93).
% 1.83/2.05 0 [] vplus(Vd79,Vd78)=vplus(Vd78,Vd79).
% 1.83/2.05 0 [] vplus(vsucc(Vd68),Vd69)=vsucc(vplus(Vd68,Vd69)).
% 1.83/2.05 0 [] vplus(v1,Vd59)=vsucc(Vd59).
% 1.83/2.05 0 [] vplus(vplus(Vd46,Vd47),Vd48)=vplus(Vd46,vplus(Vd47,Vd48)).
% 1.83/2.05 0 [] vplus(Vd42,vsucc(Vd43))=vsucc(vplus(Vd42,Vd43)).
% 1.83/2.05 0 [] vplus(Vd42,v1)=vsucc(Vd42).
% 1.83/2.05 0 [] Vd24=v1|Vd24=vsucc(vskolem2(Vd24)).
% 1.83/2.05 0 [] vsucc(Vd16)!=Vd16.
% 1.83/2.05 0 [] Vd7=Vd8|vsucc(Vd7)!=vsucc(Vd8).
% 1.83/2.05 0 [] vsucc(Vd3)!=vsucc(Vd4)|Vd3=Vd4.
% 1.83/2.05 0 [] vsucc(Vd1)!=v1.
% 1.83/2.05 end_of_list.
% 1.83/2.05
% 1.83/2.05 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.83/2.05
% 1.83/2.05 This ia a non-Horn set with equality. The strategy will be
% 1.83/2.05 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.83/2.05 deletion, with positive clauses in sos and nonpositive
% 1.83/2.05 clauses in usable.
% 1.83/2.05
% 1.83/2.05 dependent: set(knuth_bendix).
% 1.83/2.05 dependent: set(anl_eq).
% 1.83/2.05 dependent: set(para_from).
% 1.83/2.05 dependent: set(para_into).
% 1.83/2.05 dependent: clear(para_from_right).
% 1.83/2.05 dependent: clear(para_into_right).
% 1.83/2.05 dependent: set(para_from_vars).
% 1.83/2.05 dependent: set(eq_units_both_ways).
% 1.83/2.05 dependent: set(dynamic_demod_all).
% 1.83/2.05 dependent: set(dynamic_demod).
% 1.83/2.05 dependent: set(order_eq).
% 1.83/2.05 dependent: set(back_demod).
% 1.83/2.05 dependent: set(lrpo).
% 1.83/2.05 dependent: set(hyper_res).
% 1.83/2.05 dependent: set(unit_deletion).
% 1.83/2.05 dependent: set(factor).
% 1.83/2.05
% 1.83/2.05 ------------> process usable:
% 1.83/2.05 ** KEPT (pick-wt=3): 1 [] -greater(vd328,vd329).
% 1.83/2.05 ** KEPT (pick-wt=10): 2 [] -less(A,B)|less(vplus(A,C),vplus(B,C)).
% 1.83/2.05 ** KEPT (pick-wt=10): 3 [] A!=B|vplus(A,C)=vplus(B,C).
% 1.83/2.05 ** KEPT (pick-wt=10): 4 [] -greater(A,B)|greater(vplus(A,C),vplus(B,C)).
% 1.83/2.05 ** KEPT (pick-wt=9): 5 [] -le_q(A,B)| -le_q(C,A)|le_q(C,B).
% 1.83/2.05 ** KEPT (pick-wt=9): 6 [] -less(A,B)| -le_q(C,A)|less(C,B).
% 1.83/2.05 ** KEPT (pick-wt=9): 7 [] -le_q(A,B)| -less(C,A)|less(C,B).
% 1.83/2.05 ** KEPT (pick-wt=9): 8 [] -less(A,B)| -less(C,A)|less(C,B).
% 1.83/2.05 ** KEPT (pick-wt=6): 9 [] -le_q(A,B)|ge_q(B,A).
% 1.83/2.05 ** KEPT (pick-wt=6): 10 [] -ge_q(A,B)|le_q(B,A).
% 1.83/2.05 ** KEPT (pick-wt=9): 11 [] -le_q(A,B)|less(A,B)|A=B.
% 1.83/2.05 ** KEPT (pick-wt=6): 12 [] le_q(A,B)| -less(A,B).
% 1.83/2.05 ** KEPT (pick-wt=6): 13 [] le_q(A,B)|A!=B.
% 1.83/2.05 ** KEPT (pick-wt=9): 14 [] -ge_q(A,B)|greater(A,B)|A=B.
% 1.83/2.05 ** KEPT (pick-wt=6): 15 [] ge_q(A,B)| -greater(A,B).
% 1.83/2.05 ** KEPT (pick-wt=6): 16 [] ge_q(A,B)|A!=B.
% 1.83/2.05 ** KEPT (pick-wt=6): 17 [] -less(A,B)|greater(B,A).
% 1.83/2.05 ** KEPT (pick-wt=6): 18 [] -greater(A,B)|less(B,A).
% 1.83/2.05 ** KEPT (pick-wt=6): 19 [] A!=B| -less(A,B).
% 1.83/2.05 ** KEPT (pick-wt=6): 20 [] -greater(A,B)| -less(A,B).
% 1.83/2.05 ** KEPT (pick-wt=6): 21 [] A!=B| -greater(A,B).
% 1.83/2.05 ** KEPT (pick-wt=10): 23 [copy,22,flip.2] -less(A,B)|vplus(A,$f1(B,A))=B.
% 1.83/2.05 ** KEPT (pick-wt=8): 24 [] less(A,B)|B!=vplus(A,C).
% 1.83/2.05 ** KEPT (pick-wt=10): 26 [copy,25,flip.2] -greater(A,B)|vplus(B,$f2(B,A))=A.
% 1.83/2.05 ** KEPT (pick-wt=8): 27 [] greater(A,B)|A!=vplus(B,C).
% 1.83/2.05 ** KEPT (pick-wt=8): 28 [] A!=B|B!=vplus(A,C).
% 1.83/2.05 ** KEPT (pick-wt=10): 29 [] A!=vplus(B,C)|B!=vplus(A,D).
% 1.83/2.05 ** KEPT (pick-wt=8): 30 [] A!=B|A!=vplus(B,C).
% 1.83/2.05 ** KEPT (pick-wt=10): 31 [] A=B|vplus(C,A)!=vplus(C,B).
% 1.83/2.05 ** KEPT (pick-wt=5): 33 [copy,32,flip.1] vplus(A,B)!=B.
% 1.83/2.05 ** KEPT (pick-wt=4): 34 [] vsucc(A)!=A.
% 1.83/2.05 ** KEPT (pick-wt=8): 35 [] A=B|vsucc(A)!=vsucc(B).
% 1.83/2.05 Following clause subsumed by 35 during input processing: 0 [] vsucc(A)!=vsucc(B)|A=B.
% 1.83/2.05 ** KEPT (pick-wt=4): 36 [] vsucc(A)!=v1.
% 1.83/2.05
% 1.83/2.05 ------------> process sos:
% 1.83/2.05 ** KEPT (pick-wt=3): 38 [] A=A.
% 1.83/2.05 ** KEPT (pick-wt=7): 39 [] greater(vplus(vd328,vd330),vplus(vd329,vd330)).
% 2.28/2.49 ** KEPT (pick-wt=5): 40 [] greater(vplus(A,B),A).
% 2.28/2.49 ** KEPT (pick-wt=9): 41 [] A=B|greater(A,B)|less(A,B).
% 2.28/2.49 ** KEPT (pick-wt=17): 43 [copy,42,flip.2,flip.3] A=B|vplus(B,$f3(A,B))=A|vplus(A,$f4(A,B))=B.
% 2.28/2.49 ** KEPT (pick-wt=7): 44 [] vplus(A,B)=vplus(B,A).
% 2.28/2.49 ** KEPT (pick-wt=9): 46 [copy,45,flip.1] vsucc(vplus(A,B))=vplus(vsucc(A),B).
% 2.28/2.49 ---> New Demodulator: 47 [new_demod,46] vsucc(vplus(A,B))=vplus(vsucc(A),B).
% 2.28/2.49 ** KEPT (pick-wt=6): 49 [copy,48,flip.1] vsucc(A)=vplus(v1,A).
% 2.28/2.49 ---> New Demodulator: 50 [new_demod,49] vsucc(A)=vplus(v1,A).
% 2.28/2.49 ** KEPT (pick-wt=11): 51 [] vplus(vplus(A,B),C)=vplus(A,vplus(B,C)).
% 2.28/2.49 ---> New Demodulator: 52 [new_demod,51] vplus(vplus(A,B),C)=vplus(A,vplus(B,C)).
% 2.28/2.49 ** KEPT (pick-wt=11): 54 [copy,53,demod,50,50] vplus(A,vplus(v1,B))=vplus(v1,vplus(A,B)).
% 2.28/2.49 Following clause subsumed by 44 during input processing: 0 [demod,50] vplus(A,v1)=vplus(v1,A).
% 2.28/2.49 ** KEPT (pick-wt=9): 56 [copy,55,demod,50,flip.2] A=v1|vplus(v1,vskolem2(A))=A.
% 2.28/2.49 Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] A=A.
% 2.28/2.49 Following clause subsumed by 44 during input processing: 0 [copy,44,flip.1] vplus(A,B)=vplus(B,A).
% 2.28/2.49 >>>> Starting back demodulation with 47.
% 2.28/2.49 >>>> Starting back demodulation with 50.
% 2.28/2.49 >> back demodulating 46 with 50.
% 2.28/2.49 >> back demodulating 36 with 50.
% 2.28/2.49 >> back demodulating 35 with 50.
% 2.28/2.49 >> back demodulating 34 with 50.
% 2.28/2.49 >>>> Starting back demodulation with 52.
% 2.28/2.49 ** KEPT (pick-wt=11): 57 [copy,54,flip.1] vplus(v1,vplus(A,B))=vplus(A,vplus(v1,B)).
% 2.28/2.49 Following clause subsumed by 54 during input processing: 0 [copy,57,flip.1] vplus(A,vplus(v1,B))=vplus(v1,vplus(A,B)).
% 2.28/2.49
% 2.28/2.49 ======= end of input processing =======
% 2.28/2.49
% 2.28/2.49 =========== start of search ===========
% 2.28/2.49
% 2.28/2.49
% 2.28/2.49 Resetting weight limit to 8.
% 2.28/2.49
% 2.28/2.49
% 2.28/2.49 Resetting weight limit to 8.
% 2.28/2.49
% 2.28/2.49 sos_size=819
% 2.28/2.49
% 2.28/2.49
% 2.28/2.49 Resetting weight limit to 7.
% 2.28/2.49
% 2.28/2.49
% 2.28/2.49 Resetting weight limit to 7.
% 2.28/2.49
% 2.28/2.49 sos_size=1095
% 2.28/2.49
% 2.28/2.49 -------- PROOF --------
% 2.28/2.49
% 2.28/2.49 ----> UNIT CONFLICT at 0.43 sec ----> 1767 [binary,1765.1,37.1] $F.
% 2.28/2.49
% 2.28/2.49 Length of proof is 27. Level of proof is 12.
% 2.28/2.49
% 2.28/2.49 ---------------- PROOF ----------------
% 2.28/2.49 % SZS status Theorem
% 2.28/2.49 % SZS output start Refutation
% See solution above
% 2.28/2.49 ------------ end of proof -------------
% 2.28/2.49
% 2.28/2.49
% 2.28/2.49 Search stopped by max_proofs option.
% 2.28/2.49
% 2.28/2.49
% 2.28/2.49 Search stopped by max_proofs option.
% 2.28/2.49
% 2.28/2.49 ============ end of search ============
% 2.28/2.49
% 2.28/2.49 -------------- statistics -------------
% 2.28/2.49 clauses given 266
% 2.28/2.49 clauses generated 30431
% 2.28/2.49 clauses kept 1720
% 2.28/2.49 clauses forward subsumed 2489
% 2.28/2.49 clauses back subsumed 247
% 2.28/2.49 Kbytes malloced 4882
% 2.28/2.49
% 2.28/2.49 ----------- times (seconds) -----------
% 2.28/2.49 user CPU time 0.43 (0 hr, 0 min, 0 sec)
% 2.28/2.49 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.28/2.49 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.28/2.49
% 2.28/2.49 That finishes the proof of the theorem.
% 2.28/2.49
% 2.28/2.49 Process 23904 finished Wed Jul 27 09:46:57 2022
% 2.28/2.49 Otter interrupted
% 2.28/2.49 PROOF FOUND
%------------------------------------------------------------------------------