TSTP Solution File: NUM841+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM841+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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 10.10s 10.31s
% Output : Refutation 10.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 31 ( 23 unt; 2 nHn; 19 RR)
% Number of literals : 41 ( 12 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
file('NUM841+2.p',unknown),
[] ).
cnf(5,axiom,
( ~ less(A,B)
| less(vplus(A,C),vplus(B,C)) ),
file('NUM841+2.p',unknown),
[] ).
cnf(8,axiom,
( ~ less(A,B)
| greater(B,A) ),
file('NUM841+2.p',unknown),
[] ).
cnf(9,axiom,
( ~ greater(A,B)
| less(B,A) ),
file('NUM841+2.p',unknown),
[] ).
cnf(10,axiom,
( ~ greater(A,B)
| ~ less(A,B) ),
file('NUM841+2.p',unknown),
[] ).
cnf(11,axiom,
( ~ greater(A,B)
| A = vplus(B,dollar_f1(B,A)) ),
file('NUM841+2.p',unknown),
[] ).
cnf(12,plain,
( ~ greater(A,B)
| vplus(B,dollar_f1(B,A)) = A ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[11])]),
[iquote('copy,11,flip.2')] ).
cnf(17,axiom,
vplus(vd348,vd345) = vplus(vd345,vd348),
file('NUM841+2.p',unknown),
[] ).
cnf(24,axiom,
greater(vd347,vd348),
file('NUM841+2.p',unknown),
[] ).
cnf(25,axiom,
greater(vd344,vd345),
file('NUM841+2.p',unknown),
[] ).
cnf(26,axiom,
greater(vplus(A,B),A),
file('NUM841+2.p',unknown),
[] ).
cnf(27,axiom,
( A = B
| greater(A,B)
| less(A,B) ),
file('NUM841+2.p',unknown),
[] ).
cnf(28,axiom,
vplus(A,B) = vplus(B,A),
file('NUM841+2.p',unknown),
[] ).
cnf(36,axiom,
vplus(vplus(A,B),C) = vplus(A,vplus(B,C)),
file('NUM841+2.p',unknown),
[] ).
cnf(43,plain,
vplus(vd348,dollar_f1(vd348,vd347)) = vd347,
inference(hyper,[status(thm)],[24,12]),
[iquote('hyper,24,12')] ).
cnf(49,plain,
vplus(vd345,dollar_f1(vd345,vd344)) = vd344,
inference(hyper,[status(thm)],[25,12]),
[iquote('hyper,25,12')] ).
cnf(63,plain,
less(A,vplus(A,B)),
inference(hyper,[status(thm)],[26,9]),
[iquote('hyper,26,9')] ).
cnf(83,plain,
less(A,vplus(B,A)),
inference(para_from,[status(thm),theory(equality)],[28,63]),
[iquote('para_from,28.1.1,63.1.2')] ).
cnf(87,plain,
~ greater(vplus(vd347,vd344),vplus(vd345,vd348)),
inference(para_from,[status(thm),theory(equality)],[28,1]),
[iquote('para_from,28.1.1,1.1.1')] ).
cnf(92,plain,
( A = B
| greater(A,B)
| greater(B,A) ),
inference(hyper,[status(thm)],[27,8]),
[iquote('hyper,27,8')] ).
cnf(157,plain,
vplus(dollar_f1(vd348,vd347),vd348) = vd347,
inference(para_into,[status(thm),theory(equality)],[43,28]),
[iquote('para_into,43.1.1,28.1.1')] ).
cnf(194,plain,
less(A,vplus(B,vplus(C,A))),
inference(para_from,[status(thm),theory(equality)],[36,83]),
[iquote('para_from,35.1.1,83.1.2')] ).
cnf(243,plain,
vplus(dollar_f1(vd345,vd344),vd345) = vd344,
inference(para_into,[status(thm),theory(equality)],[49,28]),
[iquote('para_into,49.1.1,28.1.1')] ).
cnf(938,plain,
less(vd348,vplus(A,vd347)),
inference(para_into,[status(thm),theory(equality)],[194,157]),
[iquote('para_into,194.1.2.2,157.1.1')] ).
cnf(967,plain,
less(vd348,vplus(vd347,A)),
inference(para_into,[status(thm),theory(equality)],[938,28]),
[iquote('para_into,938.1.2,28.1.1')] ).
cnf(1000,plain,
less(vplus(vd348,A),vplus(vd347,vplus(B,A))),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[967,5]),36]),
[iquote('hyper,967,5,demod,36')] ).
cnf(4648,plain,
less(vplus(vd345,vd348),vplus(vd347,vd344)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1000,243]),17]),
[iquote('para_into,1000.1.2.2,243.1.1,demod,17')] ).
cnf(4656,plain,
vplus(vd347,vd344) = vplus(vd345,vd348),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[4648,10,92]),87]),
[iquote('hyper,4648,10,92,unit_del,87')] ).
cnf(4657,plain,
greater(vplus(vd345,vd348),vplus(vd345,vd348)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[4648,8]),4656]),
[iquote('hyper,4648,8,demod,4656')] ).
cnf(4684,plain,
~ greater(vplus(vd345,vd348),vplus(vd345,vd348)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[87]),4656]),
[iquote('back_demod,87,demod,4656')] ).
cnf(4685,plain,
$false,
inference(binary,[status(thm)],[4684,4657]),
[iquote('binary,4684.1,4657.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUM841+2 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n013.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 09:50:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.02/2.19 ----- Otter 3.3f, August 2004 -----
% 2.02/2.19 The process was started by sandbox on n013.cluster.edu,
% 2.02/2.19 Wed Jul 27 09:50:00 2022
% 2.02/2.19 The command was "./otter". The process ID is 30707.
% 2.02/2.19
% 2.02/2.19 set(prolog_style_variables).
% 2.02/2.19 set(auto).
% 2.02/2.19 dependent: set(auto1).
% 2.02/2.19 dependent: set(process_input).
% 2.02/2.19 dependent: clear(print_kept).
% 2.02/2.19 dependent: clear(print_new_demod).
% 2.02/2.19 dependent: clear(print_back_demod).
% 2.02/2.19 dependent: clear(print_back_sub).
% 2.02/2.19 dependent: set(control_memory).
% 2.02/2.19 dependent: assign(max_mem, 12000).
% 2.02/2.19 dependent: assign(pick_given_ratio, 4).
% 2.02/2.19 dependent: assign(stats_level, 1).
% 2.02/2.19 dependent: assign(max_seconds, 10800).
% 2.02/2.19 clear(print_given).
% 2.02/2.19
% 2.02/2.19 formula_list(usable).
% 2.02/2.19 all A (A=A).
% 2.02/2.19 -greater(vplus(vd344,vd347),vplus(vd345,vd348)).
% 2.02/2.19 vplus(vd348,vd345)=vplus(vd345,vd348).
% 2.02/2.19 greater(vplus(vd347,vd345),vplus(vd348,vd345)).
% 2.02/2.19 vplus(vd345,vd347)=vplus(vd347,vd345).
% 2.02/2.19 greater(vplus(vd344,vd347),vplus(vd345,vd347)).
% 2.02/2.19 greater(vd347,vd348).
% 2.02/2.19 greater(vd344,vd345).
% 2.02/2.19 all Vd328 Vd329 Vd330 (less(vplus(Vd328,Vd330),vplus(Vd329,Vd330))->less(Vd328,Vd329)).
% 2.02/2.19 all Vd328 Vd329 Vd330 (vplus(Vd328,Vd330)=vplus(Vd329,Vd330)->Vd328=Vd329).
% 2.02/2.19 all Vd328 Vd329 Vd330 (greater(vplus(Vd328,Vd330),vplus(Vd329,Vd330))->greater(Vd328,Vd329)).
% 2.02/2.19 all Vd301 Vd302 Vd303 (less(Vd301,Vd302)->less(vplus(Vd301,Vd303),vplus(Vd302,Vd303))).
% 2.02/2.19 all Vd301 Vd302 Vd303 (Vd301=Vd302->vplus(Vd301,Vd303)=vplus(Vd302,Vd303)).
% 2.02/2.19 all Vd301 Vd302 Vd303 (greater(Vd301,Vd302)->greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303))).
% 2.02/2.19 all Vd295 Vd296 greater(vplus(Vd295,Vd296),Vd295).
% 2.02/2.19 all Vd226 Vd227 (less(Vd226,Vd227)->greater(Vd227,Vd226)).
% 2.02/2.19 all Vd208 Vd209 (greater(Vd208,Vd209)->less(Vd209,Vd208)).
% 2.02/2.19 all Vd203 Vd204 (Vd203=Vd204|greater(Vd203,Vd204)|less(Vd203,Vd204)).
% 2.02/2.19 all Vd203 Vd204 (-greater(Vd203,Vd204)| -less(Vd203,Vd204)).
% 2.02/2.19 all Vd193 Vd194 (greater(Vd194,Vd193)<-> (exists Vd196 (Vd194=vplus(Vd193,Vd196)))).
% 2.02/2.19 all Vd120 Vd121 (Vd120!=Vd121| -(exists Vd123 (Vd120=vplus(Vd121,Vd123)))).
% 2.02/2.19 all Vd78 Vd79 (vplus(Vd79,Vd78)=vplus(Vd78,Vd79)).
% 2.02/2.19 all Vd68 Vd69 (vplus(vsucc(Vd68),Vd69)=vsucc(vplus(Vd68,Vd69))).
% 2.02/2.19 all Vd59 (vplus(v1,Vd59)=vsucc(Vd59)).
% 2.02/2.19 all Vd46 Vd47 Vd48 (vplus(vplus(Vd46,Vd47),Vd48)=vplus(Vd46,vplus(Vd47,Vd48))).
% 2.02/2.19 all Vd42 Vd43 (vplus(Vd42,vsucc(Vd43))=vsucc(vplus(Vd42,Vd43))&vplus(Vd42,v1)=vsucc(Vd42)).
% 2.02/2.19 all Vd24 (Vd24!=v1->Vd24=vsucc(vskolem2(Vd24))).
% 2.02/2.19 end_of_list.
% 2.02/2.19
% 2.02/2.19 -------> usable clausifies to:
% 2.02/2.19
% 2.02/2.19 list(usable).
% 2.02/2.19 0 [] A=A.
% 2.02/2.19 0 [] -greater(vplus(vd344,vd347),vplus(vd345,vd348)).
% 2.02/2.19 0 [] vplus(vd348,vd345)=vplus(vd345,vd348).
% 2.02/2.19 0 [] greater(vplus(vd347,vd345),vplus(vd348,vd345)).
% 2.02/2.19 0 [] vplus(vd345,vd347)=vplus(vd347,vd345).
% 2.02/2.19 0 [] greater(vplus(vd344,vd347),vplus(vd345,vd347)).
% 2.02/2.19 0 [] greater(vd347,vd348).
% 2.02/2.19 0 [] greater(vd344,vd345).
% 2.02/2.19 0 [] -less(vplus(Vd328,Vd330),vplus(Vd329,Vd330))|less(Vd328,Vd329).
% 2.02/2.19 0 [] vplus(Vd328,Vd330)!=vplus(Vd329,Vd330)|Vd328=Vd329.
% 2.02/2.19 0 [] -greater(vplus(Vd328,Vd330),vplus(Vd329,Vd330))|greater(Vd328,Vd329).
% 2.02/2.19 0 [] -less(Vd301,Vd302)|less(vplus(Vd301,Vd303),vplus(Vd302,Vd303)).
% 2.02/2.19 0 [] Vd301!=Vd302|vplus(Vd301,Vd303)=vplus(Vd302,Vd303).
% 2.02/2.19 0 [] -greater(Vd301,Vd302)|greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303)).
% 2.02/2.19 0 [] greater(vplus(Vd295,Vd296),Vd295).
% 2.02/2.19 0 [] -less(Vd226,Vd227)|greater(Vd227,Vd226).
% 2.02/2.19 0 [] -greater(Vd208,Vd209)|less(Vd209,Vd208).
% 2.02/2.19 0 [] Vd203=Vd204|greater(Vd203,Vd204)|less(Vd203,Vd204).
% 2.02/2.19 0 [] -greater(Vd203,Vd204)| -less(Vd203,Vd204).
% 2.02/2.19 0 [] -greater(Vd194,Vd193)|Vd194=vplus(Vd193,$f1(Vd193,Vd194)).
% 2.02/2.19 0 [] greater(Vd194,Vd193)|Vd194!=vplus(Vd193,Vd196).
% 2.02/2.19 0 [] Vd120!=Vd121|Vd120!=vplus(Vd121,Vd123).
% 2.02/2.19 0 [] vplus(Vd79,Vd78)=vplus(Vd78,Vd79).
% 2.02/2.19 0 [] vplus(vsucc(Vd68),Vd69)=vsucc(vplus(Vd68,Vd69)).
% 2.02/2.19 0 [] vplus(v1,Vd59)=vsucc(Vd59).
% 2.02/2.19 0 [] vplus(vplus(Vd46,Vd47),Vd48)=vplus(Vd46,vplus(Vd47,Vd48)).
% 2.02/2.19 0 [] vplus(Vd42,vsucc(Vd43))=vsucc(vplus(Vd42,Vd43)).
% 2.02/2.19 0 [] vplus(Vd42,v1)=vsucc(Vd42).
% 2.02/2.19 0 [] Vd24=v1|Vd24=vsucc(vskolem2(Vd24)).
% 2.02/2.19 end_of_list.
% 2.02/2.19
% 2.02/2.19 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 2.02/2.19
% 2.02/2.19 This ia a non-Horn set with equality. The strategy will be
% 2.02/2.19 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.02/2.19 deletion, with positive clauses in sos and nonpositive
% 2.02/2.19 clauses in usable.
% 2.02/2.19
% 2.02/2.19 dependent: set(knuth_bendix).
% 2.02/2.19 dependent: set(anl_eq).
% 10.10/10.31 dependent: set(para_from).
% 10.10/10.31 dependent: set(para_into).
% 10.10/10.31 dependent: clear(para_from_right).
% 10.10/10.31 dependent: clear(para_into_right).
% 10.10/10.31 dependent: set(para_from_vars).
% 10.10/10.31 dependent: set(eq_units_both_ways).
% 10.10/10.31 dependent: set(dynamic_demod_all).
% 10.10/10.31 dependent: set(dynamic_demod).
% 10.10/10.31 dependent: set(order_eq).
% 10.10/10.31 dependent: set(back_demod).
% 10.10/10.31 dependent: set(lrpo).
% 10.10/10.31 dependent: set(hyper_res).
% 10.10/10.31 dependent: set(unit_deletion).
% 10.10/10.31 dependent: set(factor).
% 10.10/10.31
% 10.10/10.31 ------------> process usable:
% 10.10/10.31 ** KEPT (pick-wt=7): 1 [] -greater(vplus(vd344,vd347),vplus(vd345,vd348)).
% 10.10/10.31 ** KEPT (pick-wt=10): 2 [] -less(vplus(A,B),vplus(C,B))|less(A,C).
% 10.10/10.31 ** KEPT (pick-wt=10): 3 [] vplus(A,B)!=vplus(C,B)|A=C.
% 10.10/10.31 ** KEPT (pick-wt=10): 4 [] -greater(vplus(A,B),vplus(C,B))|greater(A,C).
% 10.10/10.31 ** KEPT (pick-wt=10): 5 [] -less(A,B)|less(vplus(A,C),vplus(B,C)).
% 10.10/10.31 ** KEPT (pick-wt=10): 6 [] A!=B|vplus(A,C)=vplus(B,C).
% 10.10/10.31 ** KEPT (pick-wt=10): 7 [] -greater(A,B)|greater(vplus(A,C),vplus(B,C)).
% 10.10/10.31 ** KEPT (pick-wt=6): 8 [] -less(A,B)|greater(B,A).
% 10.10/10.31 ** KEPT (pick-wt=6): 9 [] -greater(A,B)|less(B,A).
% 10.10/10.31 ** KEPT (pick-wt=6): 10 [] -greater(A,B)| -less(A,B).
% 10.10/10.31 ** KEPT (pick-wt=10): 12 [copy,11,flip.2] -greater(A,B)|vplus(B,$f1(B,A))=A.
% 10.10/10.31 ** KEPT (pick-wt=8): 13 [] greater(A,B)|A!=vplus(B,C).
% 10.10/10.31 ** KEPT (pick-wt=8): 14 [] A!=B|A!=vplus(B,C).
% 10.10/10.31
% 10.10/10.31 ------------> process sos:
% 10.10/10.31 ** KEPT (pick-wt=3): 15 [] A=A.
% 10.10/10.31 ** KEPT (pick-wt=7): 16 [] vplus(vd348,vd345)=vplus(vd345,vd348).
% 10.10/10.31 ---> New Demodulator: 17 [new_demod,16] vplus(vd348,vd345)=vplus(vd345,vd348).
% 10.10/10.31 ** KEPT (pick-wt=7): 19 [copy,18,demod,17] greater(vplus(vd347,vd345),vplus(vd345,vd348)).
% 10.10/10.31 ** KEPT (pick-wt=7): 21 [copy,20,flip.1] vplus(vd347,vd345)=vplus(vd345,vd347).
% 10.10/10.31 ---> New Demodulator: 22 [new_demod,21] vplus(vd347,vd345)=vplus(vd345,vd347).
% 10.10/10.31 ** KEPT (pick-wt=7): 23 [] greater(vplus(vd344,vd347),vplus(vd345,vd347)).
% 10.10/10.31 ** KEPT (pick-wt=3): 24 [] greater(vd347,vd348).
% 10.10/10.31 ** KEPT (pick-wt=3): 25 [] greater(vd344,vd345).
% 10.10/10.31 ** KEPT (pick-wt=5): 26 [] greater(vplus(A,B),A).
% 10.10/10.31 ** KEPT (pick-wt=9): 27 [] A=B|greater(A,B)|less(A,B).
% 10.10/10.31 ** KEPT (pick-wt=7): 28 [] vplus(A,B)=vplus(B,A).
% 10.10/10.31 ** KEPT (pick-wt=9): 30 [copy,29,flip.1] vsucc(vplus(A,B))=vplus(vsucc(A),B).
% 10.10/10.31 ---> New Demodulator: 31 [new_demod,30] vsucc(vplus(A,B))=vplus(vsucc(A),B).
% 10.10/10.31 ** KEPT (pick-wt=6): 33 [copy,32,flip.1] vsucc(A)=vplus(v1,A).
% 10.10/10.31 ---> New Demodulator: 34 [new_demod,33] vsucc(A)=vplus(v1,A).
% 10.10/10.31 ** KEPT (pick-wt=11): 35 [] vplus(vplus(A,B),C)=vplus(A,vplus(B,C)).
% 10.10/10.31 ---> New Demodulator: 36 [new_demod,35] vplus(vplus(A,B),C)=vplus(A,vplus(B,C)).
% 10.10/10.31 ** KEPT (pick-wt=11): 38 [copy,37,demod,34,34] vplus(A,vplus(v1,B))=vplus(v1,vplus(A,B)).
% 10.10/10.31 Following clause subsumed by 28 during input processing: 0 [demod,34] vplus(A,v1)=vplus(v1,A).
% 10.10/10.31 ** KEPT (pick-wt=9): 40 [copy,39,demod,34,flip.2] A=v1|vplus(v1,vskolem2(A))=A.
% 10.10/10.31 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] A=A.
% 10.10/10.31 >>>> Starting back demodulation with 17.
% 10.10/10.31 >>>> Starting back demodulation with 22.
% 10.10/10.31 >> back demodulating 19 with 22.
% 10.10/10.31 Following clause subsumed by 28 during input processing: 0 [copy,28,flip.1] vplus(A,B)=vplus(B,A).
% 10.10/10.31 28 back subsumes 21.
% 10.10/10.31 28 back subsumes 16.
% 10.10/10.31 >>>> Starting back demodulation with 31.
% 10.10/10.31 >>>> Starting back demodulation with 34.
% 10.10/10.31 >> back demodulating 30 with 34.
% 10.10/10.31 >>>> Starting back demodulation with 36.
% 10.10/10.31 ** KEPT (pick-wt=11): 42 [copy,38,flip.1] vplus(v1,vplus(A,B))=vplus(A,vplus(v1,B)).
% 10.10/10.31 Following clause subsumed by 38 during input processing: 0 [copy,42,flip.1] vplus(A,vplus(v1,B))=vplus(v1,vplus(A,B)).
% 10.10/10.31
% 10.10/10.31 ======= end of input processing =======
% 10.10/10.31
% 10.10/10.31 =========== start of search ===========
% 10.10/10.31
% 10.10/10.31
% 10.10/10.31 Resetting weight limit to 9.
% 10.10/10.31
% 10.10/10.31
% 10.10/10.31 Resetting weight limit to 9.
% 10.10/10.31
% 10.10/10.31 sos_size=2660
% 10.10/10.31
% 10.10/10.31
% 10.10/10.31 Resetting weight limit to 8.
% 10.10/10.31
% 10.10/10.31
% 10.10/10.31 Resetting weight limit to 8.
% 10.10/10.31
% 10.10/10.31 sos_size=2687
% 10.10/10.31
% 10.10/10.31 -------- PROOF --------
% 10.10/10.31
% 10.10/10.31 ----> UNIT CONFLICT at 8.08 sec ----> 4685 [binary,4684.1,4657.1] $F.
% 10.10/10.31
% 10.10/10.31 Length of proof is 17. Level of proof is 9.
% 10.10/10.31
% 10.10/10.31 ---------------- PROOF ----------------
% 10.10/10.31 % SZS status Theorem
% 10.10/10.31 % SZS output start Refutation
% See solution above
% 10.10/10.31 ------------ end of proof -------------
% 10.10/10.31
% 10.10/10.31
% 10.10/10.31 Search stopped by max_proofs option.
% 10.10/10.31
% 10.10/10.31
% 10.10/10.31 Search stopped by max_proofs option.
% 10.10/10.31
% 10.10/10.31 ============ end of search ============
% 10.10/10.31
% 10.10/10.31 -------------- statistics -------------
% 10.10/10.31 clauses given 1392
% 10.10/10.31 clauses generated 413054
% 10.10/10.31 clauses kept 4572
% 10.10/10.31 clauses forward subsumed 18160
% 10.10/10.31 clauses back subsumed 1071
% 10.10/10.31 Kbytes malloced 5859
% 10.10/10.31
% 10.10/10.31 ----------- times (seconds) -----------
% 10.10/10.31 user CPU time 8.08 (0 hr, 0 min, 8 sec)
% 10.10/10.31 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 10.10/10.31 wall-clock time 10 (0 hr, 0 min, 10 sec)
% 10.10/10.31
% 10.10/10.31 That finishes the proof of the theorem.
% 10.10/10.31
% 10.10/10.31 Process 30707 finished Wed Jul 27 09:50:10 2022
% 10.10/10.31 Otter interrupted
% 10.10/10.31 PROOF FOUND
%------------------------------------------------------------------------------