TSTP Solution File: NUM840+1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : NUM840+1 : 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 2.80s 2.97s
% Output   : Refutation 2.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   22 (   8 unt;   8 nHn;  16 RR)
%            Number of literals    :   40 (  20 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   32 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ less(vd328,vd329),
    file('NUM840+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ less(A,B)
    | less(vplus(A,C),vplus(B,C)) ),
    file('NUM840+1.p',unknown),
    [] ).

cnf(20,axiom,
    ( ~ less(A,B)
    | greater(B,A) ),
    file('NUM840+1.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ greater(A,B)
    | less(B,A) ),
    file('NUM840+1.p',unknown),
    [] ).

cnf(22,axiom,
    ( A != B
    | ~ less(A,B) ),
    file('NUM840+1.p',unknown),
    [] ).

cnf(23,axiom,
    ( ~ greater(A,B)
    | ~ less(A,B) ),
    file('NUM840+1.p',unknown),
    [] ).

cnf(32,axiom,
    ( A != vplus(B,C)
    | B != vplus(A,D) ),
    file('NUM840+1.p',unknown),
    [] ).

cnf(40,plain,
    vplus(A,B) != A,
    inference(flip,[status(thm),theory(equality)],[inference(factor,[status(thm)],[32])]),
    [iquote('factor,32.1.2,flip.1')] ).

cnf(42,axiom,
    less(vplus(vd328,vd330),vplus(vd329,vd330)),
    file('NUM840+1.p',unknown),
    [] ).

cnf(44,axiom,
    ( A = B
    | greater(A,B)
    | less(A,B) ),
    file('NUM840+1.p',unknown),
    [] ).

cnf(45,axiom,
    ( A = B
    | A = vplus(B,dollar_f3(A,B))
    | B = vplus(A,dollar_f4(A,B)) ),
    file('NUM840+1.p',unknown),
    [] ).

cnf(46,plain,
    ( A = B
    | vplus(B,dollar_f3(A,B)) = A
    | vplus(A,dollar_f4(A,B)) = B ),
    inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[45])])]),
    [iquote('copy,45,flip.2,flip.3')] ).

cnf(55,axiom,
    vplus(vplus(A,B),C) = vplus(A,vplus(B,C)),
    file('NUM840+1.p',unknown),
    [] ).

cnf(82,plain,
    greater(vplus(vd329,vd330),vplus(vd328,vd330)),
    inference(hyper,[status(thm)],[42,20]),
    [iquote('hyper,42,20')] ).

cnf(164,plain,
    ( A = B
    | greater(A,B)
    | less(vplus(A,C),vplus(B,C)) ),
    inference(hyper,[status(thm)],[44,5]),
    [iquote('hyper,44,5')] ).

cnf(165,plain,
    ( vd329 = vd328
    | greater(vd328,vd329) ),
    inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[44,1])]),
    [iquote('hyper,44,1,flip.1')] ).

cnf(277,plain,
    ( vplus(vd329,vplus(vd330,dollar_f3(vplus(vd328,vd330),vplus(vd329,vd330)))) = vplus(vd328,vd330)
    | vplus(vd328,vplus(vd330,dollar_f4(vplus(vd328,vd330),vplus(vd329,vd330)))) = vplus(vd329,vd330) ),
    inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[46,22,42]),55,55]),
    [iquote('hyper,46,22,42,demod,55,55')] ).

cnf(397,plain,
    ( vd329 = vd328
    | less(vd329,vd328) ),
    inference(hyper,[status(thm)],[165,21]),
    [iquote('hyper,165,21')] ).

cnf(573,plain,
    vplus(A,vplus(B,C)) != vplus(A,B),
    inference(para_from,[status(thm),theory(equality)],[55,40]),
    [iquote('para_from,54.1.1,40.1.1')] ).

cnf(1699,plain,
    ( vd329 = vd328
    | greater(vd329,vd328) ),
    inference(hyper,[status(thm)],[164,23,82]),
    [iquote('hyper,164,23,82')] ).

cnf(1706,plain,
    vd329 = vd328,
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[1699,23,397])]),
    [iquote('hyper,1699,23,397,factor_simp')] ).

cnf(1874,plain,
    $false,
    inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[277]),1706,1706,1706,1706]),573,573]),
    [iquote('back_demod,277,demod,1706,1706,1706,1706,unit_del,573,573')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : NUM840+1 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n013.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:45:30 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.01/2.21  ----- Otter 3.3f, August 2004 -----
% 2.01/2.21  The process was started by sandbox on n013.cluster.edu,
% 2.01/2.21  Wed Jul 27 09:45:30 2022
% 2.01/2.21  The command was "./otter".  The process ID is 17786.
% 2.01/2.21  
% 2.01/2.21  set(prolog_style_variables).
% 2.01/2.21  set(auto).
% 2.01/2.21     dependent: set(auto1).
% 2.01/2.21     dependent: set(process_input).
% 2.01/2.21     dependent: clear(print_kept).
% 2.01/2.21     dependent: clear(print_new_demod).
% 2.01/2.21     dependent: clear(print_back_demod).
% 2.01/2.21     dependent: clear(print_back_sub).
% 2.01/2.21     dependent: set(control_memory).
% 2.01/2.21     dependent: assign(max_mem, 12000).
% 2.01/2.21     dependent: assign(pick_given_ratio, 4).
% 2.01/2.21     dependent: assign(stats_level, 1).
% 2.01/2.21     dependent: assign(max_seconds, 10800).
% 2.01/2.21  clear(print_given).
% 2.01/2.21  
% 2.01/2.21  formula_list(usable).
% 2.01/2.21  all A (A=A).
% 2.01/2.21  -less(vd328,vd329).
% 2.01/2.21  less(vplus(vd328,vd330),vplus(vd329,vd330)).
% 2.01/2.21  vplus(vd328,vd330)=vplus(vd329,vd330)->vd328=vd329.
% 2.01/2.21  greater(vplus(vd328,vd330),vplus(vd329,vd330))->greater(vd328,vd329).
% 2.01/2.21  all Vd301 Vd302 Vd303 (less(Vd301,Vd302)->less(vplus(Vd301,Vd303),vplus(Vd302,Vd303))).
% 2.01/2.21  all Vd301 Vd302 Vd303 (Vd301=Vd302->vplus(Vd301,Vd303)=vplus(Vd302,Vd303)).
% 2.01/2.21  all Vd301 Vd302 Vd303 (greater(Vd301,Vd302)->greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303))).
% 2.01/2.21  all Vd295 Vd296 greater(vplus(Vd295,Vd296),Vd295).
% 2.01/2.21  all Vd289 Vd290 Vd292 (le_q(Vd290,Vd292)&le_q(Vd289,Vd290)->le_q(Vd289,Vd292)).
% 2.01/2.21  all Vd281 Vd282 Vd283 (less(Vd282,Vd283)&le_q(Vd281,Vd282)|le_q(Vd282,Vd283)&less(Vd281,Vd282)->less(Vd281,Vd283)).
% 2.01/2.21  all Vd262 Vd263 Vd265 (less(Vd263,Vd265)&less(Vd262,Vd263)->less(Vd262,Vd265)).
% 2.01/2.21  all Vd258 Vd259 (le_q(Vd258,Vd259)->ge_q(Vd259,Vd258)).
% 2.01/2.21  all Vd254 Vd255 (ge_q(Vd254,Vd255)->le_q(Vd255,Vd254)).
% 2.01/2.21  all Vd249 Vd250 (le_q(Vd250,Vd249)<->less(Vd250,Vd249)|Vd250=Vd249).
% 2.01/2.21  all Vd244 Vd245 (ge_q(Vd245,Vd244)<->greater(Vd245,Vd244)|Vd245=Vd244).
% 2.01/2.21  all Vd226 Vd227 (less(Vd226,Vd227)->greater(Vd227,Vd226)).
% 2.01/2.21  all Vd208 Vd209 (greater(Vd208,Vd209)->less(Vd209,Vd208)).
% 2.01/2.21  all Vd203 Vd204 (Vd203=Vd204|greater(Vd203,Vd204)|less(Vd203,Vd204)).
% 2.01/2.21  all Vd203 Vd204 (Vd203!=Vd204| -less(Vd203,Vd204)).
% 2.01/2.21  all Vd203 Vd204 (-greater(Vd203,Vd204)| -less(Vd203,Vd204)).
% 2.01/2.21  all Vd203 Vd204 (Vd203!=Vd204| -greater(Vd203,Vd204)).
% 2.01/2.21  all Vd198 Vd199 (less(Vd199,Vd198)<-> (exists Vd201 (Vd198=vplus(Vd199,Vd201)))).
% 2.01/2.21  all Vd193 Vd194 (greater(Vd194,Vd193)<-> (exists Vd196 (Vd194=vplus(Vd193,Vd196)))).
% 2.01/2.21  all Vd120 Vd121 (Vd120=Vd121| (exists Vd123 (Vd120=vplus(Vd121,Vd123)))| (exists Vd125 (Vd121=vplus(Vd120,Vd125)))).
% 2.01/2.21  all Vd120 Vd121 (Vd120!=Vd121| -(exists Vd125 (Vd121=vplus(Vd120,Vd125)))).
% 2.01/2.21  all Vd120 Vd121 (-(exists Vd123 (Vd120=vplus(Vd121,Vd123)))| -(exists Vd125 (Vd121=vplus(Vd120,Vd125)))).
% 2.01/2.21  all Vd120 Vd121 (Vd120!=Vd121| -(exists Vd123 (Vd120=vplus(Vd121,Vd123)))).
% 2.01/2.21  all Vd104 Vd105 (Vd104!=Vd105-> (all Vd107 (vplus(Vd107,Vd104)!=vplus(Vd107,Vd105)))).
% 2.01/2.21  all Vd92 Vd93 (Vd93!=vplus(Vd92,Vd93)).
% 2.01/2.21  all Vd78 Vd79 (vplus(Vd79,Vd78)=vplus(Vd78,Vd79)).
% 2.01/2.21  all Vd68 Vd69 (vplus(vsucc(Vd68),Vd69)=vsucc(vplus(Vd68,Vd69))).
% 2.01/2.21  all Vd59 (vplus(v1,Vd59)=vsucc(Vd59)).
% 2.01/2.21  all Vd46 Vd47 Vd48 (vplus(vplus(Vd46,Vd47),Vd48)=vplus(Vd46,vplus(Vd47,Vd48))).
% 2.01/2.21  all Vd42 Vd43 (vplus(Vd42,vsucc(Vd43))=vsucc(vplus(Vd42,Vd43))&vplus(Vd42,v1)=vsucc(Vd42)).
% 2.01/2.21  all Vd24 (Vd24!=v1->Vd24=vsucc(vskolem2(Vd24))).
% 2.01/2.21  all Vd16 (vsucc(Vd16)!=Vd16).
% 2.01/2.21  all Vd7 Vd8 (Vd7!=Vd8->vsucc(Vd7)!=vsucc(Vd8)).
% 2.01/2.21  all Vd3 Vd4 (vsucc(Vd3)=vsucc(Vd4)->Vd3=Vd4).
% 2.01/2.21  all Vd1 (vsucc(Vd1)!=v1).
% 2.01/2.21  end_of_list.
% 2.01/2.21  
% 2.01/2.21  -------> usable clausifies to:
% 2.01/2.21  
% 2.01/2.21  list(usable).
% 2.01/2.21  0 [] A=A.
% 2.01/2.21  0 [] -less(vd328,vd329).
% 2.01/2.21  0 [] less(vplus(vd328,vd330),vplus(vd329,vd330)).
% 2.01/2.21  0 [] vplus(vd328,vd330)!=vplus(vd329,vd330)|vd328=vd329.
% 2.01/2.21  0 [] -greater(vplus(vd328,vd330),vplus(vd329,vd330))|greater(vd328,vd329).
% 2.01/2.21  0 [] -less(Vd301,Vd302)|less(vplus(Vd301,Vd303),vplus(Vd302,Vd303)).
% 2.01/2.21  0 [] Vd301!=Vd302|vplus(Vd301,Vd303)=vplus(Vd302,Vd303).
% 2.01/2.21  0 [] -greater(Vd301,Vd302)|greater(vplus(Vd301,Vd303),vplus(Vd302,Vd303)).
% 2.01/2.21  0 [] greater(vplus(Vd295,Vd296),Vd295).
% 2.01/2.21  0 [] -le_q(Vd290,Vd292)| -le_q(Vd289,Vd290)|le_q(Vd289,Vd292).
% 2.01/2.21  0 [] -less(Vd282,Vd283)| -le_q(Vd281,Vd282)|less(Vd281,Vd283).
% 2.01/2.21  0 [] -le_q(Vd282,Vd283)| -less(Vd281,Vd282)|less(Vd281,Vd283).
% 2.01/2.21  0 [] -less(Vd263,Vd265)| -less(Vd262,Vd263)|less(Vd262,Vd265).
% 2.01/2.21  0 [] -le_q(Vd258,Vd259)|ge_q(Vd259,Vd258).
% 2.01/2.21  0 [] -ge_q(Vd254,Vd255)|le_q(Vd255,Vd254).
% 2.01/2.21  0 [] -le_q(Vd250,Vd249)|less(Vd250,Vd249)|Vd250=Vd249.
% 2.01/2.21  0 [] le_q(Vd250,Vd249)| -less(Vd250,Vd249).
% 2.01/2.21  0 [] le_q(Vd250,Vd249)|Vd250!=Vd249.
% 2.01/2.21  0 [] -ge_q(Vd245,Vd244)|greater(Vd245,Vd244)|Vd245=Vd244.
% 2.01/2.21  0 [] ge_q(Vd245,Vd244)| -greater(Vd245,Vd244).
% 2.01/2.21  0 [] ge_q(Vd245,Vd244)|Vd245!=Vd244.
% 2.01/2.21  0 [] -less(Vd226,Vd227)|greater(Vd227,Vd226).
% 2.01/2.21  0 [] -greater(Vd208,Vd209)|less(Vd209,Vd208).
% 2.01/2.21  0 [] Vd203=Vd204|greater(Vd203,Vd204)|less(Vd203,Vd204).
% 2.01/2.21  0 [] Vd203!=Vd204| -less(Vd203,Vd204).
% 2.01/2.21  0 [] -greater(Vd203,Vd204)| -less(Vd203,Vd204).
% 2.01/2.21  0 [] Vd203!=Vd204| -greater(Vd203,Vd204).
% 2.01/2.21  0 [] -less(Vd199,Vd198)|Vd198=vplus(Vd199,$f1(Vd198,Vd199)).
% 2.01/2.21  0 [] less(Vd199,Vd198)|Vd198!=vplus(Vd199,Vd201).
% 2.01/2.21  0 [] -greater(Vd194,Vd193)|Vd194=vplus(Vd193,$f2(Vd193,Vd194)).
% 2.01/2.21  0 [] greater(Vd194,Vd193)|Vd194!=vplus(Vd193,Vd196).
% 2.01/2.21  0 [] Vd120=Vd121|Vd120=vplus(Vd121,$f3(Vd120,Vd121))|Vd121=vplus(Vd120,$f4(Vd120,Vd121)).
% 2.01/2.21  0 [] Vd120!=Vd121|Vd121!=vplus(Vd120,Vd125).
% 2.01/2.21  0 [] Vd120!=vplus(Vd121,Vd123)|Vd121!=vplus(Vd120,Vd125).
% 2.01/2.21  0 [] Vd120!=Vd121|Vd120!=vplus(Vd121,Vd123).
% 2.01/2.21  0 [] Vd104=Vd105|vplus(Vd107,Vd104)!=vplus(Vd107,Vd105).
% 2.01/2.21  0 [] Vd93!=vplus(Vd92,Vd93).
% 2.01/2.21  0 [] vplus(Vd79,Vd78)=vplus(Vd78,Vd79).
% 2.01/2.21  0 [] vplus(vsucc(Vd68),Vd69)=vsucc(vplus(Vd68,Vd69)).
% 2.01/2.21  0 [] vplus(v1,Vd59)=vsucc(Vd59).
% 2.01/2.21  0 [] vplus(vplus(Vd46,Vd47),Vd48)=vplus(Vd46,vplus(Vd47,Vd48)).
% 2.01/2.21  0 [] vplus(Vd42,vsucc(Vd43))=vsucc(vplus(Vd42,Vd43)).
% 2.01/2.21  0 [] vplus(Vd42,v1)=vsucc(Vd42).
% 2.01/2.21  0 [] Vd24=v1|Vd24=vsucc(vskolem2(Vd24)).
% 2.01/2.21  0 [] vsucc(Vd16)!=Vd16.
% 2.01/2.21  0 [] Vd7=Vd8|vsucc(Vd7)!=vsucc(Vd8).
% 2.01/2.21  0 [] vsucc(Vd3)!=vsucc(Vd4)|Vd3=Vd4.
% 2.01/2.21  0 [] vsucc(Vd1)!=v1.
% 2.01/2.21  end_of_list.
% 2.01/2.21  
% 2.01/2.21  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 2.01/2.21  
% 2.01/2.21  This ia a non-Horn set with equality.  The strategy will be
% 2.01/2.21  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.01/2.21  deletion, with positive clauses in sos and nonpositive
% 2.01/2.21  clauses in usable.
% 2.01/2.21  
% 2.01/2.21     dependent: set(knuth_bendix).
% 2.01/2.21     dependent: set(anl_eq).
% 2.01/2.21     dependent: set(para_from).
% 2.01/2.21     dependent: set(para_into).
% 2.01/2.21     dependent: clear(para_from_right).
% 2.01/2.21     dependent: clear(para_into_right).
% 2.01/2.21     dependent: set(para_from_vars).
% 2.01/2.21     dependent: set(eq_units_both_ways).
% 2.01/2.21     dependent: set(dynamic_demod_all).
% 2.01/2.21     dependent: set(dynamic_demod).
% 2.01/2.21     dependent: set(order_eq).
% 2.01/2.21     dependent: set(back_demod).
% 2.01/2.21     dependent: set(lrpo).
% 2.01/2.21     dependent: set(hyper_res).
% 2.01/2.21     dependent: set(unit_deletion).
% 2.01/2.21     dependent: set(factor).
% 2.01/2.21  
% 2.01/2.21  ------------> process usable:
% 2.01/2.21  ** KEPT (pick-wt=3): 1 [] -less(vd328,vd329).
% 2.01/2.21  ** KEPT (pick-wt=10): 3 [copy,2,flip.1,flip.2] vplus(vd329,vd330)!=vplus(vd328,vd330)|vd329=vd328.
% 2.01/2.21  ** KEPT (pick-wt=10): 4 [] -greater(vplus(vd328,vd330),vplus(vd329,vd330))|greater(vd328,vd329).
% 2.01/2.21  ** KEPT (pick-wt=10): 5 [] -less(A,B)|less(vplus(A,C),vplus(B,C)).
% 2.01/2.21  ** KEPT (pick-wt=10): 6 [] A!=B|vplus(A,C)=vplus(B,C).
% 2.01/2.21  ** KEPT (pick-wt=10): 7 [] -greater(A,B)|greater(vplus(A,C),vplus(B,C)).
% 2.01/2.21  ** KEPT (pick-wt=9): 8 [] -le_q(A,B)| -le_q(C,A)|le_q(C,B).
% 2.01/2.21  ** KEPT (pick-wt=9): 9 [] -less(A,B)| -le_q(C,A)|less(C,B).
% 2.01/2.21  ** KEPT (pick-wt=9): 10 [] -le_q(A,B)| -less(C,A)|less(C,B).
% 2.01/2.21  ** KEPT (pick-wt=9): 11 [] -less(A,B)| -less(C,A)|less(C,B).
% 2.01/2.21  ** KEPT (pick-wt=6): 12 [] -le_q(A,B)|ge_q(B,A).
% 2.01/2.21  ** KEPT (pick-wt=6): 13 [] -ge_q(A,B)|le_q(B,A).
% 2.01/2.21  ** KEPT (pick-wt=9): 14 [] -le_q(A,B)|less(A,B)|A=B.
% 2.01/2.21  ** KEPT (pick-wt=6): 15 [] le_q(A,B)| -less(A,B).
% 2.01/2.21  ** KEPT (pick-wt=6): 16 [] le_q(A,B)|A!=B.
% 2.01/2.21  ** KEPT (pick-wt=9): 17 [] -ge_q(A,B)|greater(A,B)|A=B.
% 2.01/2.21  ** KEPT (pick-wt=6): 18 [] ge_q(A,B)| -greater(A,B).
% 2.01/2.21  ** KEPT (pick-wt=6): 19 [] ge_q(A,B)|A!=B.
% 2.01/2.21  ** KEPT (pick-wt=6): 20 [] -less(A,B)|greater(B,A).
% 2.01/2.21  ** KEPT (pick-wt=6): 21 [] -greater(A,B)|less(B,A).
% 2.01/2.21  ** KEPT (pick-wt=6): 22 [] A!=B| -less(A,B).
% 2.01/2.21  ** KEPT (pick-wt=6): 23 [] -greater(A,B)| -less(A,B).
% 2.01/2.21  ** KEPT (pick-wt=6): 24 [] A!=B| -greater(A,B).
% 2.01/2.21  ** KEPT (pick-wt=10): 26 [copy,25,flip.2] -less(A,B)|vplus(A,$f1(B,A))=B.
% 2.01/2.21  ** KEPT (pick-wt=8): 27 [] less(A,B)|B!=vplus(A,C).
% 2.01/2.21  ** KEPT (pick-wt=10): 29 [copy,28,flip.2] -greater(A,B)|vplus(B,$f2(B,A))=A.
% 2.01/2.21  ** KEPT (pick-wt=8): 30 [] greater(A,B)|A!=vplus(B,C).
% 2.01/2.21  ** KEPT (pick-wt=8): 31 [] A!=B|B!=vplus(A,C).
% 2.01/2.21  ** KEPT (pick-wt=10): 32 [] A!=vplus(B,C)|B!=vplus(A,D).
% 2.01/2.21  ** KEPT (pick-wt=8): 33 [] A!=B|A!=vplus(B,C).
% 2.80/2.97  ** KEPT (pick-wt=10): 34 [] A=B|vplus(C,A)!=vplus(C,B).
% 2.80/2.97  ** KEPT (pick-wt=5): 36 [copy,35,flip.1] vplus(A,B)!=B.
% 2.80/2.97  ** KEPT (pick-wt=4): 37 [] vsucc(A)!=A.
% 2.80/2.97  ** KEPT (pick-wt=8): 38 [] A=B|vsucc(A)!=vsucc(B).
% 2.80/2.97    Following clause subsumed by 38 during input processing: 0 [] vsucc(A)!=vsucc(B)|A=B.
% 2.80/2.97  ** KEPT (pick-wt=4): 39 [] vsucc(A)!=v1.
% 2.80/2.97  
% 2.80/2.97  ------------> process sos:
% 2.80/2.97  ** KEPT (pick-wt=3): 41 [] A=A.
% 2.80/2.97  ** KEPT (pick-wt=7): 42 [] less(vplus(vd328,vd330),vplus(vd329,vd330)).
% 2.80/2.97  ** KEPT (pick-wt=5): 43 [] greater(vplus(A,B),A).
% 2.80/2.97  ** KEPT (pick-wt=9): 44 [] A=B|greater(A,B)|less(A,B).
% 2.80/2.97  ** KEPT (pick-wt=17): 46 [copy,45,flip.2,flip.3] A=B|vplus(B,$f3(A,B))=A|vplus(A,$f4(A,B))=B.
% 2.80/2.97  ** KEPT (pick-wt=7): 47 [] vplus(A,B)=vplus(B,A).
% 2.80/2.97  ** KEPT (pick-wt=9): 49 [copy,48,flip.1] vsucc(vplus(A,B))=vplus(vsucc(A),B).
% 2.80/2.97  ---> New Demodulator: 50 [new_demod,49] vsucc(vplus(A,B))=vplus(vsucc(A),B).
% 2.80/2.97  ** KEPT (pick-wt=6): 52 [copy,51,flip.1] vsucc(A)=vplus(v1,A).
% 2.80/2.97  ---> New Demodulator: 53 [new_demod,52] vsucc(A)=vplus(v1,A).
% 2.80/2.97  ** KEPT (pick-wt=11): 54 [] vplus(vplus(A,B),C)=vplus(A,vplus(B,C)).
% 2.80/2.97  ---> New Demodulator: 55 [new_demod,54] vplus(vplus(A,B),C)=vplus(A,vplus(B,C)).
% 2.80/2.97  ** KEPT (pick-wt=11): 57 [copy,56,demod,53,53] vplus(A,vplus(v1,B))=vplus(v1,vplus(A,B)).
% 2.80/2.97    Following clause subsumed by 47 during input processing: 0 [demod,53] vplus(A,v1)=vplus(v1,A).
% 2.80/2.97  ** KEPT (pick-wt=9): 59 [copy,58,demod,53,flip.2] A=v1|vplus(v1,vskolem2(A))=A.
% 2.80/2.97    Following clause subsumed by 41 during input processing: 0 [copy,41,flip.1] A=A.
% 2.80/2.97    Following clause subsumed by 47 during input processing: 0 [copy,47,flip.1] vplus(A,B)=vplus(B,A).
% 2.80/2.97  >>>> Starting back demodulation with 50.
% 2.80/2.97  >>>> Starting back demodulation with 53.
% 2.80/2.97      >> back demodulating 49 with 53.
% 2.80/2.97      >> back demodulating 39 with 53.
% 2.80/2.97      >> back demodulating 38 with 53.
% 2.80/2.97      >> back demodulating 37 with 53.
% 2.80/2.97  >>>> Starting back demodulation with 55.
% 2.80/2.97  ** KEPT (pick-wt=11): 60 [copy,57,flip.1] vplus(v1,vplus(A,B))=vplus(A,vplus(v1,B)).
% 2.80/2.97    Following clause subsumed by 57 during input processing: 0 [copy,60,flip.1] vplus(A,vplus(v1,B))=vplus(v1,vplus(A,B)).
% 2.80/2.97  
% 2.80/2.97  ======= end of input processing =======
% 2.80/2.97  
% 2.80/2.97  =========== start of search ===========
% 2.80/2.97  
% 2.80/2.97  
% 2.80/2.97  Resetting weight limit to 8.
% 2.80/2.97  
% 2.80/2.97  
% 2.80/2.97  Resetting weight limit to 8.
% 2.80/2.97  
% 2.80/2.97  sos_size=792
% 2.80/2.97  
% 2.80/2.97  -------- PROOF -------- 
% 2.80/2.97  
% 2.80/2.97  -----> EMPTY CLAUSE at   0.77 sec ----> 1874 [back_demod,277,demod,1706,1706,1706,1706,unit_del,573,573] $F.
% 2.80/2.97  
% 2.80/2.97  Length of proof is 10.  Level of proof is 3.
% 2.80/2.97  
% 2.80/2.97  ---------------- PROOF ----------------
% 2.80/2.97  % SZS status Theorem
% 2.80/2.97  % SZS output start Refutation
% See solution above
% 2.80/2.97  ------------ end of proof -------------
% 2.80/2.97  
% 2.80/2.97  
% 2.80/2.97  Search stopped by max_proofs option.
% 2.80/2.97  
% 2.80/2.97  
% 2.80/2.97  Search stopped by max_proofs option.
% 2.80/2.97  
% 2.80/2.97  ============ end of search ============
% 2.80/2.97  
% 2.80/2.97  -------------- statistics -------------
% 2.80/2.97  clauses given                437
% 2.80/2.97  clauses generated          80888
% 2.80/2.97  clauses kept                1837
% 2.80/2.97  clauses forward subsumed    4327
% 2.80/2.97  clauses back subsumed        149
% 2.80/2.97  Kbytes malloced             5859
% 2.80/2.97  
% 2.80/2.97  ----------- times (seconds) -----------
% 2.80/2.97  user CPU time          0.77          (0 hr, 0 min, 0 sec)
% 2.80/2.97  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 2.80/2.97  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 2.80/2.97  
% 2.80/2.97  That finishes the proof of the theorem.
% 2.80/2.97  
% 2.80/2.97  Process 17786 finished Wed Jul 27 09:45:32 2022
% 2.80/2.97  Otter interrupted
% 2.80/2.97  PROOF FOUND
%------------------------------------------------------------------------------