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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : CSR016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n012.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 12:48:36 EDT 2022

% Result   : Theorem 275.34s 275.55s
% Output   : Refutation 275.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   23
% Syntax   : Number of clauses     :   50 (  24 unt;  13 nHn;  42 RR)
%            Number of literals    :   98 (  34 equ;  43 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-3 aty)
%            Number of variables   :   55 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ( ~ stoppedIn(A,B,C)
    | less(dollar_f1(A,B,C),C) ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(5,axiom,
    ( stoppedIn(A,B,C)
    | ~ happens(D,E)
    | ~ less(A,E)
    | ~ less(E,C)
    | ~ terminates(D,B,E) ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ happens(A,B)
    | ~ initiates(A,C,B)
    | holdsAt(C,plus(B,n1)) ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(30,axiom,
    ( ~ initiates(A,B,C)
    | B = forwards
    | A = pull ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(38,axiom,
    ( initiates(A,B,C)
    | A != push
    | B != forwards
    | happens(pull,C) ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(40,axiom,
    ( initiates(A,B,C)
    | A != pull
    | B != spinning
    | ~ happens(push,C) ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(54,axiom,
    ( terminates(A,B,C)
    | A != pull
    | B != spinning
    | happens(push,C) ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(57,axiom,
    ( ~ happens(A,B)
    | A = push
    | B = n1
    | B = n2 ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(58,axiom,
    ( ~ happens(A,B)
    | B = n0
    | A = pull
    | B = n2 ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(60,axiom,
    ( happens(A,B)
    | A != push
    | B != n0 ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(61,axiom,
    ( happens(A,B)
    | A != pull
    | B != n1 ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(64,axiom,
    push != pull,
    file('CSR016+1.p',unknown),
    [] ).

cnf(66,axiom,
    forwards != spinning,
    file('CSR016+1.p',unknown),
    [] ).

cnf(67,plain,
    spinning != forwards,
    inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[66])]),
    [iquote('copy,66,flip.1')] ).

cnf(69,axiom,
    ( ~ less_or_e_qual(A,B)
    | less(A,B)
    | A = B ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(71,axiom,
    ( less_or_e_qual(A,B)
    | A != B ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(72,axiom,
    ~ less(A,n0),
    file('CSR016+1.p',unknown),
    [] ).

cnf(74,axiom,
    ( less(A,n1)
    | ~ less_or_e_qual(A,n0) ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(76,axiom,
    ( less(A,n2)
    | ~ less_or_e_qual(A,n1) ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(91,axiom,
    ( ~ less(A,B)
    | ~ less(B,A) ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(97,axiom,
    ~ holdsAt(forwards,n1),
    file('CSR016+1.p',unknown),
    [] ).

cnf(98,plain,
    ~ less(A,A),
    inference(factor,[status(thm)],[91]),
    [iquote('factor,91.1.2')] ).

cnf(99,axiom,
    A = A,
    file('CSR016+1.p',unknown),
    [] ).

cnf(103,axiom,
    plus(n0,n1) = n1,
    file('CSR016+1.p',unknown),
    [] ).

cnf(121,axiom,
    ( less(A,B)
    | less(B,A)
    | B = A ),
    file('CSR016+1.p',unknown),
    [] ).

cnf(122,plain,
    less_or_e_qual(A,A),
    inference(hyper,[status(thm)],[99,71]),
    [iquote('hyper,99,71')] ).

cnf(125,plain,
    happens(pull,n1),
    inference(hyper,[status(thm)],[99,61,99]),
    [iquote('hyper,99,61,99')] ).

cnf(126,plain,
    happens(push,n0),
    inference(hyper,[status(thm)],[99,60,99]),
    [iquote('hyper,99,60,99')] ).

cnf(127,plain,
    ( terminates(pull,spinning,A)
    | happens(push,A) ),
    inference(hyper,[status(thm)],[99,54,99]),
    [iquote('hyper,99,54,99')] ).

cnf(132,plain,
    ( initiates(push,forwards,A)
    | happens(pull,A) ),
    inference(hyper,[status(thm)],[99,38,99]),
    [iquote('hyper,99,38,99')] ).

cnf(140,plain,
    less(n1,n2),
    inference(hyper,[status(thm)],[122,76]),
    [iquote('hyper,122,76')] ).

cnf(141,plain,
    less(n0,n1),
    inference(hyper,[status(thm)],[122,74]),
    [iquote('hyper,122,74')] ).

cnf(547,plain,
    initiates(pull,spinning,n0),
    inference(hyper,[status(thm)],[126,40,99,99]),
    [iquote('hyper,126,40,99,99')] ).

cnf(1074,plain,
    ( A = n1
    | ~ less_or_e_qual(n1,A)
    | less(n1,A) ),
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[103,69]),103,103]),
    [iquote('para_into,102.1.1,69.3.1,demod,103,103')] ).

cnf(1670,plain,
    ( ~ happens(A,n1)
    | n1 = n0
    | A = pull ),
    inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[140,58]),98]),
    [iquote('para_into,140.1.1,58.4.1,unit_del,98')] ).

cnf(1769,plain,
    ( ~ happens(A,n0)
    | A = push
    | n2 = n0 ),
    inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[141,57]),98])]),
    [iquote('para_into,141.1.1,57.3.1,unit_del,98,flip.3')] ).

cnf(4400,plain,
    ( happens(push,A)
    | less(n0,A) ),
    inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[121,126]),72]),
    [iquote('para_from,121.3.1,126.1.2,unit_del,72')] ).

cnf(6278,plain,
    ~ less_or_e_qual(n1,n0),
    inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[1074,141]),98,72]),
    [iquote('para_from,1074.1.1,141.1.1,unit_del,98,72')] ).

cnf(6444,plain,
    ( ~ happens(A,n1)
    | A = pull ),
    inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[1670,6278]),122]),
    [iquote('para_from,1670.2.1,6278.1.1,unit_del,122')] ).

cnf(6447,plain,
    terminates(pull,spinning,n1),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[6444,127]),64]),
    [iquote('hyper,6444,127,unit_del,64')] ).

cnf(6802,plain,
    ~ happens(push,n1),
    inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[6444,64]),99]),
    [iquote('para_from,6444.2.1,64.1.1,unit_del,99')] ).

cnf(6920,plain,
    ( ~ initiates(push,A,B)
    | A = forwards ),
    inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[6802,30]),125]),
    [iquote('para_into,6802.1.1,30.3.1,unit_del,125')] ).

cnf(7069,plain,
    stoppedIn(n0,spinning,n2),
    inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[6447,5,125,4400,140]),6802]),
    [iquote('hyper,6447,5,125,4400,140,unit_del,6802')] ).

cnf(7156,plain,
    less(dollar_f1(n0,spinning,n2),n2),
    inference(hyper,[status(thm)],[7069,3]),
    [iquote('hyper,7069,3')] ).

cnf(7395,plain,
    ~ initiates(push,spinning,A),
    inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[6920,67]),99]),
    [iquote('para_from,6920.2.1,67.1.1,unit_del,99')] ).

cnf(7396,plain,
    ( ~ happens(pull,n0)
    | n2 = n0 ),
    inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[1769,547]),7395]),
    [iquote('para_from,1769.2.1,547.1.1,unit_del,7395')] ).

cnf(7399,plain,
    ~ happens(pull,n0),
    inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[7396,7156]),72]),
    [iquote('para_from,7396.2.1,7156.1.2,unit_del,72')] ).

cnf(7400,plain,
    initiates(push,forwards,n0),
    inference(hyper,[status(thm)],[7399,132]),
    [iquote('hyper,7399,132')] ).

cnf(7441,plain,
    holdsAt(forwards,n1),
    inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[7400,21,126]),103]),
    [iquote('hyper,7400,21,126,demod,103')] ).

cnf(7442,plain,
    $false,
    inference(binary,[status(thm)],[7441,97]),
    [iquote('binary,7441.1,97.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR016+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.07/0.13  % Command  : otter-tptp-script %s
% 0.12/0.34  % Computer : n012.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Jul 27 04:09:20 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.96/2.12  ----- Otter 3.3f, August 2004 -----
% 1.96/2.12  The process was started by sandbox on n012.cluster.edu,
% 1.96/2.12  Wed Jul 27 04:09:20 2022
% 1.96/2.12  The command was "./otter".  The process ID is 2759.
% 1.96/2.12  
% 1.96/2.12  set(prolog_style_variables).
% 1.96/2.12  set(auto).
% 1.96/2.12     dependent: set(auto1).
% 1.96/2.12     dependent: set(process_input).
% 1.96/2.12     dependent: clear(print_kept).
% 1.96/2.12     dependent: clear(print_new_demod).
% 1.96/2.12     dependent: clear(print_back_demod).
% 1.96/2.12     dependent: clear(print_back_sub).
% 1.96/2.12     dependent: set(control_memory).
% 1.96/2.12     dependent: assign(max_mem, 12000).
% 1.96/2.12     dependent: assign(pick_given_ratio, 4).
% 1.96/2.12     dependent: assign(stats_level, 1).
% 1.96/2.12     dependent: assign(max_seconds, 10800).
% 1.96/2.12  clear(print_given).
% 1.96/2.12  
% 1.96/2.12  formula_list(usable).
% 1.96/2.12  all A (A=A).
% 1.96/2.12  all Time1 Fluent Time2 (stoppedIn(Time1,Fluent,Time2)<-> (exists Event Time (happens(Event,Time)&less(Time1,Time)&less(Time,Time2)&terminates(Event,Fluent,Time)))).
% 1.96/2.12  all Time1 Time2 Fluent (startedIn(Time1,Fluent,Time2)<-> (exists Event Time (happens(Event,Time)&less(Time1,Time)&less(Time,Time2)&initiates(Event,Fluent,Time)))).
% 1.96/2.12  all Event Time Fluent Fluent2 Offset (happens(Event,Time)&initiates(Event,Fluent,Time)&less(n0,Offset)&trajectory(Fluent,Time,Fluent2,Offset)& -stoppedIn(Time,Fluent,plus(Time,Offset))->holdsAt(Fluent2,plus(Time,Offset))).
% 1.96/2.12  all Event Time1 Fluent1 Time2 Fluent2 (happens(Event,Time1)&terminates(Event,Fluent1,Time1)&less(n0,Time2)&antitrajectory(Fluent1,Time1,Fluent2,Time2)& -startedIn(Time1,Fluent1,plus(Time1,Time2))->holdsAt(Fluent2,plus(Time1,Time2))).
% 1.96/2.12  all Fluent Time (holdsAt(Fluent,Time)& -releasedAt(Fluent,plus(Time,n1))& -(exists Event (happens(Event,Time)&terminates(Event,Fluent,Time)))->holdsAt(Fluent,plus(Time,n1))).
% 1.96/2.12  all Fluent Time (-holdsAt(Fluent,Time)& -releasedAt(Fluent,plus(Time,n1))& -(exists Event (happens(Event,Time)&initiates(Event,Fluent,Time)))-> -holdsAt(Fluent,plus(Time,n1))).
% 1.96/2.12  all Fluent Time (releasedAt(Fluent,Time)& -(exists Event (happens(Event,Time)& (initiates(Event,Fluent,Time)|terminates(Event,Fluent,Time))))->releasedAt(Fluent,plus(Time,n1))).
% 1.96/2.12  all Fluent Time (-releasedAt(Fluent,Time)& -(exists Event (happens(Event,Time)&releases(Event,Fluent,Time)))-> -releasedAt(Fluent,plus(Time,n1))).
% 1.96/2.12  all Event Time Fluent (happens(Event,Time)&initiates(Event,Fluent,Time)->holdsAt(Fluent,plus(Time,n1))).
% 1.96/2.12  all Event Time Fluent (happens(Event,Time)&terminates(Event,Fluent,Time)-> -holdsAt(Fluent,plus(Time,n1))).
% 1.96/2.12  all Event Time Fluent (happens(Event,Time)&releases(Event,Fluent,Time)->releasedAt(Fluent,plus(Time,n1))).
% 1.96/2.12  all Event Time Fluent (happens(Event,Time)& (initiates(Event,Fluent,Time)|terminates(Event,Fluent,Time))-> -releasedAt(Fluent,plus(Time,n1))).
% 1.96/2.12  all Event Fluent Time (initiates(Event,Fluent,Time)<->Event=push&Fluent=forwards& -happens(pull,Time)|Event=pull&Fluent=backwards& -happens(push,Time)|Event=pull&Fluent=spinning&happens(push,Time)).
% 1.96/2.12  all Event Fluent Time (terminates(Event,Fluent,Time)<->Event=push&Fluent=backwards& -happens(pull,Time)|Event=pull&Fluent=forwards& -happens(push,Time)|Event=pull&Fluent=forwards&happens(push,Time)|Event=pull&Fluent=backwards&happens(push,Time)|Event=push&Fluent=spinning& -happens(pull,Time)|Event=pull&Fluent=spinning& -happens(push,Time)).
% 1.96/2.12  all Event Fluent Time (-releases(Event,Fluent,Time)).
% 1.96/2.12  all Event Time (happens(Event,Time)<->Event=push&Time=n0|Event=pull&Time=n1|Event=pull&Time=n2|Event=push&Time=n2).
% 1.96/2.12  push!=pull.
% 1.96/2.12  forwards!=backwards.
% 1.96/2.12  forwards!=spinning.
% 1.96/2.12  spinning!=backwards.
% 1.96/2.12  plus(n0,n0)=n0.
% 1.96/2.12  plus(n0,n1)=n1.
% 1.96/2.12  plus(n0,n2)=n2.
% 1.96/2.12  plus(n0,n3)=n3.
% 1.96/2.12  plus(n1,n1)=n2.
% 1.96/2.12  plus(n1,n2)=n3.
% 1.96/2.12  plus(n1,n3)=n4.
% 1.96/2.12  plus(n2,n2)=n4.
% 1.96/2.12  plus(n2,n3)=n5.
% 1.96/2.12  plus(n3,n3)=n6.
% 1.96/2.12  all X Y (plus(X,Y)=plus(Y,X)).
% 1.96/2.12  all X Y (less_or_e_qual(X,Y)<->less(X,Y)|X=Y).
% 1.96/2.12  -(exists X less(X,n0)).
% 1.96/2.12  all X (less(X,n1)<->less_or_e_qual(X,n0)).
% 1.96/2.12  all X (less(X,n2)<->less_or_e_qual(X,n1)).
% 1.96/2.12  all X (less(X,n3)<->less_or_e_qual(X,n2)).
% 1.96/2.12  all X (less(X,n4)<->less_or_e_qual(X,n3)).
% 1.96/2.12  all X (less(X,n5)<->less_or_e_qual(X,n4)).
% 1.96/2.12  all X (less(X,n6)<->less_or_e_qual(X,n5)).
% 1.96/2.12  all X (less(X,n7)<->less_or_e_qual(X,n6)).
% 1.96/2.12  all X (less(X,n8)<->less_or_e_qual(X,n7)).
% 1.96/2.12  all X (less(X,n9)<->less_or_e_qual(X,n8)).
% 1.96/2.12  all X Y (less(X,Y)<-> -less(Y,X)&Y!=X).
% 1.96/2.12  -holdsAt(forwards,n0).
% 1.96/2.12  -holdsAt(backwards,n0).
% 1.96/2.12  -holdsAt(spinning,n0).
% 1.96/2.12  all Fluent Time (-releasedAt(Fluent,Time)).
% 1.96/2.12  -holdsAt(forwards,n1).
% 1.96/2.12  end_of_list.
% 1.96/2.12  
% 1.96/2.12  -------> usable clausifies to:
% 1.96/2.12  
% 1.96/2.12  list(usable).
% 1.96/2.12  0 [] A=A.
% 1.96/2.12  0 [] -stoppedIn(Time1,Fluent,Time2)|happens($f2(Time1,Fluent,Time2),$f1(Time1,Fluent,Time2)).
% 1.96/2.12  0 [] -stoppedIn(Time1,Fluent,Time2)|less(Time1,$f1(Time1,Fluent,Time2)).
% 1.96/2.12  0 [] -stoppedIn(Time1,Fluent,Time2)|less($f1(Time1,Fluent,Time2),Time2).
% 1.96/2.12  0 [] -stoppedIn(Time1,Fluent,Time2)|terminates($f2(Time1,Fluent,Time2),Fluent,$f1(Time1,Fluent,Time2)).
% 1.96/2.12  0 [] stoppedIn(Time1,Fluent,Time2)| -happens(Event,Time)| -less(Time1,Time)| -less(Time,Time2)| -terminates(Event,Fluent,Time).
% 1.96/2.12  0 [] -startedIn(Time1,Fluent,Time2)|happens($f4(Time1,Time2,Fluent),$f3(Time1,Time2,Fluent)).
% 1.96/2.12  0 [] -startedIn(Time1,Fluent,Time2)|less(Time1,$f3(Time1,Time2,Fluent)).
% 1.96/2.12  0 [] -startedIn(Time1,Fluent,Time2)|less($f3(Time1,Time2,Fluent),Time2).
% 1.96/2.12  0 [] -startedIn(Time1,Fluent,Time2)|initiates($f4(Time1,Time2,Fluent),Fluent,$f3(Time1,Time2,Fluent)).
% 1.96/2.12  0 [] startedIn(Time1,Fluent,Time2)| -happens(Event,Time)| -less(Time1,Time)| -less(Time,Time2)| -initiates(Event,Fluent,Time).
% 1.96/2.12  0 [] -happens(Event,Time)| -initiates(Event,Fluent,Time)| -less(n0,Offset)| -trajectory(Fluent,Time,Fluent2,Offset)|stoppedIn(Time,Fluent,plus(Time,Offset))|holdsAt(Fluent2,plus(Time,Offset)).
% 1.96/2.12  0 [] -happens(Event,Time1)| -terminates(Event,Fluent1,Time1)| -less(n0,Time2)| -antitrajectory(Fluent1,Time1,Fluent2,Time2)|startedIn(Time1,Fluent1,plus(Time1,Time2))|holdsAt(Fluent2,plus(Time1,Time2)).
% 1.96/2.12  0 [] -holdsAt(Fluent,Time)|releasedAt(Fluent,plus(Time,n1))|happens($f5(Fluent,Time),Time)|holdsAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] -holdsAt(Fluent,Time)|releasedAt(Fluent,plus(Time,n1))|terminates($f5(Fluent,Time),Fluent,Time)|holdsAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] holdsAt(Fluent,Time)|releasedAt(Fluent,plus(Time,n1))|happens($f6(Fluent,Time),Time)| -holdsAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] holdsAt(Fluent,Time)|releasedAt(Fluent,plus(Time,n1))|initiates($f6(Fluent,Time),Fluent,Time)| -holdsAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] -releasedAt(Fluent,Time)|happens($f7(Fluent,Time),Time)|releasedAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] -releasedAt(Fluent,Time)|initiates($f7(Fluent,Time),Fluent,Time)|terminates($f7(Fluent,Time),Fluent,Time)|releasedAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] releasedAt(Fluent,Time)|happens($f8(Fluent,Time),Time)| -releasedAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] releasedAt(Fluent,Time)|releases($f8(Fluent,Time),Fluent,Time)| -releasedAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] -happens(Event,Time)| -initiates(Event,Fluent,Time)|holdsAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] -happens(Event,Time)| -terminates(Event,Fluent,Time)| -holdsAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] -happens(Event,Time)| -releases(Event,Fluent,Time)|releasedAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] -happens(Event,Time)| -initiates(Event,Fluent,Time)| -releasedAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] -happens(Event,Time)| -terminates(Event,Fluent,Time)| -releasedAt(Fluent,plus(Time,n1)).
% 1.96/2.12  0 [] -initiates(Event,Fluent,Time)|Event=push|Event=pull.
% 1.96/2.12  0 [] -initiates(Event,Fluent,Time)|Event=push|Fluent=backwards|Fluent=spinning.
% 1.96/2.12  0 [] -initiates(Event,Fluent,Time)|Event=push|Fluent=backwards|happens(push,Time).
% 1.96/2.12  0 [] -initiates(Event,Fluent,Time)|Event=push| -happens(push,Time)|Fluent=spinning.
% 1.96/2.12  0 [] -initiates(Event,Fluent,Time)|Fluent=forwards|Event=pull.
% 1.96/2.12  0 [] -initiates(Event,Fluent,Time)|Fluent=forwards|Fluent=backwards|Fluent=spinning.
% 1.96/2.12  0 [] -initiates(Event,Fluent,Time)|Fluent=forwards|Fluent=backwards|happens(push,Time).
% 1.96/2.12  0 [] -initiates(Event,Fluent,Time)|Fluent=forwards| -happens(push,Time)|Fluent=spinning.
% 1.96/2.12  0 [] -initiates(Event,Fluent,Time)| -happens(pull,Time)|Event=pull.
% 1.96/2.12  0 [] -initiates(Event,Fluent,Time)| -happens(pull,Time)|Fluent=backwards|Fluent=spinning.
% 1.96/2.12  0 [] -initiates(Event,Fluent,Time)| -happens(pull,Time)|Fluent=backwards|happens(push,Time).
% 1.96/2.12  0 [] -initiates(Event,Fluent,Time)| -happens(pull,Time)| -happens(push,Time)|Fluent=spinning.
% 1.96/2.12  0 [] initiates(Event,Fluent,Time)|Event!=push|Fluent!=forwards|happens(pull,Time).
% 1.96/2.12  0 [] initiates(Event,Fluent,Time)|Event!=pull|Fluent!=backwards|happens(push,Time).
% 1.96/2.12  0 [] initiates(Event,Fluent,Time)|Event!=pull|Fluent!=spinning| -happens(push,Time).
% 1.96/2.12  0 [] -terminates(Event,Fluent,Time)|Event=push|Event=pull.
% 1.96/2.12  0 [] -terminates(Event,Fluent,Time)|Event=push|Fluent=forwards|Fluent=backwards| -happens(push,Time).
% 1.96/2.12  0 [] -terminates(Event,Fluent,Time)|Event=push|Fluent=forwards|happens(push,Time)|Fluent=spinning.
% 1.96/2.12  0 [] -terminates(Event,Fluent,Time)|Fluent=backwards|Event=pull|Fluent=spinning.
% 1.96/2.12  0 [] -terminates(Event,Fluent,Time)|Fluent=backwards|Fluent=forwards|Fluent=spinning.
% 1.96/2.12  0 [] -terminates(Event,Fluent,Time)|Fluent=backwards|Fluent=forwards| -happens(pull,Time)| -happens(push,Time).
% 1.96/2.12  0 [] -terminates(Event,Fluent,Time)| -happens(pull,Time)|Event=pull.
% 1.96/2.12  0 [] -terminates(Event,Fluent,Time)| -happens(pull,Time)|Fluent=forwards|happens(push,Time)|Fluent=spinning.
% 1.96/2.12  0 [] terminates(Event,Fluent,Time)|Event!=push|Fluent!=backwards|happens(pull,Time).
% 1.96/2.12  0 [] terminates(Event,Fluent,Time)|Event!=pull|Fluent!=forwards|happens(push,Time).
% 1.96/2.12  0 [] terminates(Event,Fluent,Time)|Event!=pull|Fluent!=forwards| -happens(push,Time).
% 1.96/2.12  0 [] terminates(Event,Fluent,Time)|Event!=pull|Fluent!=backwards| -happens(push,Time).
% 1.96/2.12  0 [] terminates(Event,Fluent,Time)|Event!=push|Fluent!=spinning|happens(pull,Time).
% 1.96/2.12  0 [] terminates(Event,Fluent,Time)|Event!=pull|Fluent!=spinning|happens(push,Time).
% 1.96/2.12  0 [] -releases(Event,Fluent,Time).
% 1.96/2.12  0 [] -happens(Event,Time)|Event=push|Event=pull.
% 1.96/2.12  0 [] -happens(Event,Time)|Event=push|Time=n1|Time=n2.
% 1.96/2.12  0 [] -happens(Event,Time)|Time=n0|Event=pull|Time=n2.
% 1.96/2.12  0 [] -happens(Event,Time)|Time=n0|Time=n1|Time=n2.
% 1.96/2.12  0 [] happens(Event,Time)|Event!=push|Time!=n0.
% 1.96/2.12  0 [] happens(Event,Time)|Event!=pull|Time!=n1.
% 1.96/2.12  0 [] happens(Event,Time)|Event!=pull|Time!=n2.
% 1.96/2.12  0 [] happens(Event,Time)|Event!=push|Time!=n2.
% 1.96/2.12  0 [] push!=pull.
% 1.96/2.12  0 [] forwards!=backwards.
% 1.96/2.12  0 [] forwards!=spinning.
% 1.96/2.12  0 [] spinning!=backwards.
% 1.96/2.12  0 [] plus(n0,n0)=n0.
% 1.96/2.12  0 [] plus(n0,n1)=n1.
% 1.96/2.12  0 [] plus(n0,n2)=n2.
% 1.96/2.12  0 [] plus(n0,n3)=n3.
% 1.96/2.12  0 [] plus(n1,n1)=n2.
% 1.96/2.12  0 [] plus(n1,n2)=n3.
% 1.96/2.12  0 [] plus(n1,n3)=n4.
% 1.96/2.12  0 [] plus(n2,n2)=n4.
% 1.96/2.12  0 [] plus(n2,n3)=n5.
% 1.96/2.12  0 [] plus(n3,n3)=n6.
% 1.96/2.12  0 [] plus(X,Y)=plus(Y,X).
% 1.96/2.12  0 [] -less_or_e_qual(X,Y)|less(X,Y)|X=Y.
% 1.96/2.12  0 [] less_or_e_qual(X,Y)| -less(X,Y).
% 1.96/2.12  0 [] less_or_e_qual(X,Y)|X!=Y.
% 1.96/2.12  0 [] -less(X,n0).
% 1.96/2.12  0 [] -less(X,n1)|less_or_e_qual(X,n0).
% 1.96/2.12  0 [] less(X,n1)| -less_or_e_qual(X,n0).
% 1.96/2.12  0 [] -less(X,n2)|less_or_e_qual(X,n1).
% 1.96/2.12  0 [] less(X,n2)| -less_or_e_qual(X,n1).
% 1.96/2.12  0 [] -less(X,n3)|less_or_e_qual(X,n2).
% 1.96/2.12  0 [] less(X,n3)| -less_or_e_qual(X,n2).
% 1.96/2.12  0 [] -less(X,n4)|less_or_e_qual(X,n3).
% 1.96/2.12  0 [] less(X,n4)| -less_or_e_qual(X,n3).
% 1.96/2.12  0 [] -less(X,n5)|less_or_e_qual(X,n4).
% 1.96/2.12  0 [] less(X,n5)| -less_or_e_qual(X,n4).
% 1.96/2.12  0 [] -less(X,n6)|less_or_e_qual(X,n5).
% 1.96/2.12  0 [] less(X,n6)| -less_or_e_qual(X,n5).
% 1.96/2.12  0 [] -less(X,n7)|less_or_e_qual(X,n6).
% 1.96/2.12  0 [] less(X,n7)| -less_or_e_qual(X,n6).
% 1.96/2.12  0 [] -less(X,n8)|less_or_e_qual(X,n7).
% 1.96/2.12  0 [] less(X,n8)| -less_or_e_qual(X,n7).
% 1.96/2.12  0 [] -less(X,n9)|less_or_e_qual(X,n8).
% 1.96/2.12  0 [] less(X,n9)| -less_or_e_qual(X,n8).
% 1.96/2.12  0 [] -less(X,Y)| -less(Y,X).
% 1.96/2.12  0 [] -less(X,Y)|Y!=X.
% 1.96/2.12  0 [] less(X,Y)|less(Y,X)|Y=X.
% 1.96/2.12  0 [] -holdsAt(forwards,n0).
% 1.96/2.12  0 [] -holdsAt(backwards,n0).
% 1.96/2.12  0 [] -holdsAt(spinning,n0).
% 1.96/2.12  0 [] -releasedAt(Fluent,Time).
% 1.96/2.12  0 [] -holdsAt(forwards,n1).
% 1.96/2.12  end_of_list.
% 1.96/2.12  
% 1.96/2.12  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.96/2.12  
% 1.96/2.12  This ia a non-Horn set with equality.  The strategy will be
% 1.96/2.12  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.96/2.12  deletion, with positive clauses in sos and nonpositive
% 1.96/2.12  clauses in usable.
% 1.96/2.12  
% 1.96/2.12     dependent: set(knuth_bendix).
% 1.96/2.12     dependent: set(anl_eq).
% 1.96/2.12     dependent: set(para_from).
% 1.96/2.12     dependent: set(para_into).
% 1.96/2.12     dependent: clear(para_from_right).
% 1.96/2.12     dependent: clear(para_into_right).
% 1.96/2.12     dependent: set(para_from_vars).
% 1.96/2.12     dependent: set(eq_units_both_ways).
% 1.96/2.12     dependent: set(dynamic_demod_all).
% 1.96/2.12     dependent: set(dynamic_demod).
% 1.96/2.12     dependent: set(order_eq).
% 1.96/2.12     dependent: set(back_demod).
% 1.96/2.12     dependent: set(lrpo).
% 1.96/2.12     dependent: set(hyper_res).
% 1.96/2.12     dependent: set(unit_deletion).
% 1.96/2.12     dependent: set(factor).
% 1.96/2.12  
% 1.96/2.12  ------------> process usable:
% 1.96/2.12  ** KEPT (pick-wt=13): 1 [] -stoppedIn(A,B,C)|happens($f2(A,B,C),$f1(A,B,C)).
% 1.96/2.12  ** KEPT (pick-wt=10): 2 [] -stoppedIn(A,B,C)|less(A,$f1(A,B,C)).
% 1.96/2.12  ** KEPT (pick-wt=10): 3 [] -stoppedIn(A,B,C)|less($f1(A,B,C),C).
% 1.96/2.12  ** KEPT (pick-wt=14): 4 [] -stoppedIn(A,B,C)|terminates($f2(A,B,C),B,$f1(A,B,C)).
% 1.96/2.12  ** KEPT (pick-wt=17): 5 [] stoppedIn(A,B,C)| -happens(D,E)| -less(A,E)| -less(E,C)| -terminates(D,B,E).
% 1.96/2.12  ** KEPT (pick-wt=13): 6 [] -startedIn(A,B,C)|happens($f4(A,C,B),$f3(A,C,B)).
% 1.96/2.12  ** KEPT (pick-wt=10): 7 [] -startedIn(A,B,C)|less(A,$f3(A,C,B)).
% 1.96/2.12  ** KEPT (pick-wt=10): 8 [] -startedIn(A,B,C)|less($f3(A,C,B),C).
% 1.96/2.12  ** KEPT (pick-wt=14): 9 [] -startedIn(A,B,C)|initiates($f4(A,C,B),B,$f3(A,C,B)).
% 1.96/2.12  ** KEPT (pick-wt=17): 10 [] startedIn(A,B,C)| -happens(D,E)| -less(A,E)| -less(E,C)| -initiates(D,B,E).
% 1.96/2.12  ** KEPT (pick-wt=26): 11 [] -happens(A,B)| -initiates(A,C,B)| -less(n0,D)| -trajectory(C,B,E,D)|stoppedIn(B,C,plus(B,D))|holdsAt(E,plus(B,D)).
% 1.96/2.12  ** KEPT (pick-wt=26): 12 [] -happens(A,B)| -terminates(A,C,B)| -less(n0,D)| -antitrajectory(C,B,E,D)|startedIn(B,C,plus(B,D))|holdsAt(E,plus(B,D)).
% 1.96/2.12  ** KEPT (pick-wt=18): 13 [] -holdsAt(A,B)|releasedAt(A,plus(B,n1))|happens($f5(A,B),B)|holdsAt(A,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=19): 14 [] -holdsAt(A,B)|releasedAt(A,plus(B,n1))|terminates($f5(A,B),A,B)|holdsAt(A,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=18): 15 [] holdsAt(A,B)|releasedAt(A,plus(B,n1))|happens($f6(A,B),B)| -holdsAt(A,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=19): 16 [] holdsAt(A,B)|releasedAt(A,plus(B,n1))|initiates($f6(A,B),A,B)| -holdsAt(A,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=13): 17 [] -releasedAt(A,B)|happens($f7(A,B),B)|releasedAt(A,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=20): 18 [] -releasedAt(A,B)|initiates($f7(A,B),A,B)|terminates($f7(A,B),A,B)|releasedAt(A,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=13): 19 [] releasedAt(A,B)|happens($f8(A,B),B)| -releasedAt(A,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=14): 20 [] releasedAt(A,B)|releases($f8(A,B),A,B)| -releasedAt(A,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=12): 21 [] -happens(A,B)| -initiates(A,C,B)|holdsAt(C,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=12): 22 [] -happens(A,B)| -terminates(A,C,B)| -holdsAt(C,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=12): 23 [] -happens(A,B)| -releases(A,C,B)|releasedAt(C,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=12): 24 [] -happens(A,B)| -initiates(A,C,B)| -releasedAt(C,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=12): 25 [] -happens(A,B)| -terminates(A,C,B)| -releasedAt(C,plus(B,n1)).
% 1.96/2.12  ** KEPT (pick-wt=10): 26 [] -initiates(A,B,C)|A=push|A=pull.
% 1.96/2.12  ** KEPT (pick-wt=13): 27 [] -initiates(A,B,C)|A=push|B=backwards|B=spinning.
% 1.96/2.12  ** KEPT (pick-wt=13): 28 [] -initiates(A,B,C)|A=push|B=backwards|happens(push,C).
% 1.96/2.12  ** KEPT (pick-wt=13): 29 [] -initiates(A,B,C)|A=push| -happens(push,C)|B=spinning.
% 1.96/2.12  ** KEPT (pick-wt=10): 30 [] -initiates(A,B,C)|B=forwards|A=pull.
% 1.96/2.12  ** KEPT (pick-wt=13): 31 [] -initiates(A,B,C)|B=forwards|B=backwards|B=spinning.
% 1.96/2.12  ** KEPT (pick-wt=13): 32 [] -initiates(A,B,C)|B=forwards|B=backwards|happens(push,C).
% 1.96/2.12  ** KEPT (pick-wt=13): 33 [] -initiates(A,B,C)|B=forwards| -happens(push,C)|B=spinning.
% 1.96/2.12  ** KEPT (pick-wt=10): 34 [] -initiates(A,B,C)| -happens(pull,C)|A=pull.
% 1.96/2.12  ** KEPT (pick-wt=13): 35 [] -initiates(A,B,C)| -happens(pull,C)|B=backwards|B=spinning.
% 1.96/2.12  ** KEPT (pick-wt=13): 36 [] -initiates(A,B,C)| -happens(pull,C)|B=backwards|happens(push,C).
% 1.96/2.12  ** KEPT (pick-wt=13): 37 [] -initiates(A,B,C)| -happens(pull,C)| -happens(push,C)|B=spinning.
% 1.96/2.12  ** KEPT (pick-wt=13): 38 [] initiates(A,B,C)|A!=push|B!=forwards|happens(pull,C).
% 1.96/2.12  ** KEPT (pick-wt=13): 39 [] initiates(A,B,C)|A!=pull|B!=backwards|happens(push,C).
% 1.96/2.12  ** KEPT (pick-wt=13): 40 [] initiates(A,B,C)|A!=pull|B!=spinning| -happens(push,C).
% 1.96/2.12  ** KEPT (pick-wt=10): 41 [] -terminates(A,B,C)|A=push|A=pull.
% 1.96/2.12  ** KEPT (pick-wt=16): 42 [] -terminates(A,B,C)|A=push|B=forwards|B=backwards| -happens(push,C).
% 1.96/2.12  ** KEPT (pick-wt=16): 43 [] -terminates(A,B,C)|A=push|B=forwards|happens(push,C)|B=spinning.
% 1.96/2.12  ** KEPT (pick-wt=13): 44 [] -terminates(A,B,C)|B=backwards|A=pull|B=spinning.
% 1.96/2.12  ** KEPT (pick-wt=13): 45 [] -terminates(A,B,C)|B=backwards|B=forwards|B=spinning.
% 1.96/2.12  ** KEPT (pick-wt=16): 46 [] -terminates(A,B,C)|B=backwards|B=forwards| -happens(pull,C)| -happens(push,C).
% 1.96/2.12  ** KEPT (pick-wt=10): 47 [] -terminates(A,B,C)| -happens(pull,C)|A=pull.
% 1.96/2.12  ** KEPT (pick-wt=16): 48 [] -terminates(A,B,C)| -happens(pull,C)|B=forwards|happens(push,C)|B=spinning.
% 1.96/2.12  ** KEPT (pick-wt=13): 49 [] terminates(A,B,C)|A!=push|B!=backwards|happens(pull,C).
% 1.96/2.12  ** KEPT (pick-wt=13): 50 [] terminates(A,B,C)|A!=pull|B!=forwards|happens(push,C).
% 1.96/2.12  ** KEPT (pick-wt=13): 51 [] terminates(A,B,C)|A!=pull|B!=forwards| -happens(push,C).
% 1.96/2.12  ** KEPT (pick-wt=13): 52 [] terminates(A,B,C)|A!=pull|B!=backwards| -happens(push,C).
% 1.96/2.12  ** KEPT (pick-wt=13): 53 [] terminates(A,B,C)|A!=push|B!=spinning|happens(pull,C).
% 1.96/2.12  ** KEPT (pick-wt=13): 54 [] terminates(A,B,C)|A!=pull|B!=spinning|happens(push,C).
% 1.96/2.12  ** KEPT (pick-wt=4): 55 [] -releases(A,B,C).
% 1.96/2.12  ** KEPT (pick-wt=9): 56 [] -happens(A,B)|A=push|A=pull.
% 1.96/2.12  ** KEPT (pick-wt=12): 57 [] -happens(A,B)|A=push|B=n1|B=n2.
% 1.96/2.12  ** KEPT (pick-wt=12): 58 [] -happens(A,B)|B=n0|A=pull|B=n2.
% 1.96/2.12  ** KEPT (pick-wt=12): 59 [] -happens(A,B)|B=n0|B=n1|B=n2.
% 1.96/2.12  ** KEPT (pick-wt=9): 60 [] happens(A,B)|A!=push|B!=n0.
% 1.96/2.12  ** KEPT (pick-wt=9): 61 [] happens(A,B)|A!=pull|B!=n1.
% 1.96/2.12  ** KEPT (pick-wt=9): 62 [] happens(A,B)|A!=pull|B!=n2.
% 1.96/2.12  ** KEPT (pick-wt=9): 63 [] happens(A,B)|A!=push|B!=n2.
% 1.96/2.12  ** KEPT (pick-wt=3): 64 [] push!=pull.
% 1.96/2.12  ** KEPT (pick-wt=3): 65 [] forwards!=backwards.
% 1.96/2.12  ** KEPT (pick-wt=3): 67 [copy,66,flip.1] spinning!=forwards.
% 1.96/2.12  ** KEPT (pick-wt=3): 68 [] spinning!=backwards.
% 1.96/2.12  ** KEPT (pick-wt=9): 69 [] -less_or_e_qual(A,B)|less(A,B)|A=B.
% 1.96/2.12  ** KEPT (pick-wt=6): 70 [] less_or_e_qual(A,B)| -less(A,B).
% 1.96/2.12  ** KEPT (pick-wt=6): 71 [] less_or_e_qual(A,B)|A!=B.
% 1.96/2.12  ** KEPT (pick-wt=3): 72 [] -less(A,n0).
% 1.96/2.12  ** KEPT (pick-wt=6): 73 [] -less(A,n1)|less_or_e_qual(A,n0).
% 1.96/2.12  ** KEPT (pick-wt=6): 74 [] less(A,n1)| -less_or_e_qual(A,n0).
% 1.96/2.12  ** KEPT (pick-wt=6): 75 [] -less(A,n2)|less_or_e_qual(A,n1).
% 1.96/2.12  ** KEPT (pick-wt=6): 76 [] less(A,n2)| -less_or_e_qual(A,n1).
% 1.96/2.12  ** KEPT (pick-wt=6): 77 [] -less(A,n3)|less_or_e_qual(A,n2).
% 1.96/2.12  ** KEPT (pick-wt=6): 78 [] less(A,n3)| -less_or_e_qual(A,n2).
% 1.96/2.12  ** KEPT (pick-wt=6): 79 [] -less(A,n4)|less_or_e_qual(A,n3).
% 1.96/2.12  ** KEPT (pick-wt=6): 80 [] less(A,n4)| -less_or_e_qual(A,n3).
% 1.96/2.12  ** KEPT (pick-wt=6): 81 [] -less(A,n5)|less_or_e_qual(A,n4).
% 1.96/2.12  ** KEPT (pick-wt=6): 82 [] less(A,n5)| -less_or_e_qual(A,n4).
% 1.96/2.12  ** KEPT (pick-wt=6): 83 [] -less(A,n6)|less_or_e_qual(A,n5).
% 1.96/2.12  ** KEPT (pick-wt=6): 84 [] less(A,n6)| -less_or_e_qual(A,n5).
% 1.96/2.12  ** KEPT (pick-wt=6): 85 [] -less(A,n7)|less_or_e_qual(A,n6).
% 1.96/2.12  ** KEPT (pick-wt=6): 86 [] less(A,n7)| -less_or_e_qual(A,n6).
% 1.96/2.12  ** KEPT (pick-wt=6): 87 [] -less(A,n8)|less_or_e_qual(A,n7).
% 1.96/2.12  ** KEPT (pick-wt=6): 88 [] less(A,n8)| -less_or_e_qual(A,n7).
% 1.96/2.12  ** KEPT (pick-wt=6): 89 [] -less(A,n9)|less_or_e_qual(A,n8).
% 1.96/2.12  ** KEPT (pick-wt=6): 90 [] less(A,n9)| -less_or_e_qual(A,n8).
% 1.96/2.12  ** KEPT (pick-wt=6): 91 [] -less(A,B)| -less(B,A).
% 1.96/2.12  ** KEPT (pick-wt=6): 92 [] -less(A,B)|B!=A.
% 1.96/2.12  ** KEPT (pick-wt=3): 93 [] -holdsAt(forwards,n0).
% 1.96/2.12  ** KEPT (pick-wt=3): 94 [] -holdsAt(backwards,n0).
% 1.96/2.12  ** KEPT (pick-wt=3): 95 [] -holdsAt(spinning,n0).
% 1.96/2.12  ** KEPT (pick-wt=3): 96 [] -releasedAt(A,B).
% 1.96/2.12  ** KEPT (pick-wt=3): 97 [] -holdsAt(forwards,n1).
% 1.96/2.12  55 back subsumes 23.
% 1.96/2.12  96 back subsumes 25.
% 1.96/2.12  96 back subsumes 24.
% 1.96/2.12  96 back subsumes 20.
% 1.96/2.12  96 back subsumes 19.
% 1.96/2.12  96 back subsumes 18.
% 1.96/2.12  96 back subsumes 17.
% 1.96/2.12  
% 1.96/2.12  ------------> process sos:
% 1.96/2.12  ** KEPT (pick-wt=3): 99 [] A=A.
% 1.96/2.12  ** KEPT (pick-wt=5): 100 [] plus(n0,n0)=n0.
% 1.96/2.12  ---> New Demodulator: 101 [new_demod,100] plus(n0,n0)=n0.
% 1.96/2.12  ** KEPT (pick-wt=5): 102 [] plus(n0,n1)=n1.
% 1.96/2.12  ---> New Demodulator: 103 [new_demod,102] plus(n0,n1)=n1.
% 1.96/2.12  ** KEPT (pick-wt=5): 104 [] plus(n0,n2)=n2.
% 1.96/2.12  ---> New Demodulator: 105 [new_demod,104] plus(n0,n2)=n2.
% 1.96/2.12  ** KEPT (pick-wt=5): 106 [] plus(n0,n3)=n3.
% 1.96/2.12  ---> New Demodulator: 107 [new_demod,106] plus(n0,n3)=n3.
% 1.96/2.12  ** KEPT (pick-wt=5): 108 [] plus(n1,n1)=n2.
% 1.96/2.12  ---> New Demodulator: 109 [new_demod,108] plus(n1,n1)=n2.
% 1.96/2.12  ** KEPT (pick-wt=5): 110 [] plus(n1,n2)=n3.
% 1.96/2.12  ---> New Demodulator: 111 [new_demod,110] plus(n1,n2)=n3.
% 1.96/2.12  ** KEPT (pick-wt=5): 112 [] plus(n1,n3)=n4.
% 1.96/2.12  ---> New Demodulator: 113 [new_demod,112] plus(n1,n3)=n4.
% 1.96/2.12  ** KEPT (pick-wt=5): 114 [] plus(n2,n2)=n4.
% 1.96/2.12  ---> New Demodulator: 115 [new_demod,114] plus(n2,n2)=n4.
% 1.96/2.12  ** KEPT (pick-wt=5): 116 [] plus(n2,n3)=n5.
% 1.96/2.12  ---> New Demodulator: 117 [new_demod,116] plus(n2,n3)=n5.
% 1.96/2.12  ** KEPT (pick-wt=5): 118 [] plus(n3,n3)=n6.
% 1.96/2.12  ---> New Demodulator: 119 [new_demod,118] plus(n3,n3)=n6.
% 1.96/2.12  ** KEPT (pick-wt=7): 120 [] plus(A,B)=plus(B,A).
% 275.34/275.55  ** KEPT (pick-wt=9): 121 [] less(A,B)|less(B,A)|B=A.
% 275.34/275.55    Following clause subsumed by 99 during input processing: 0 [copy,99,flip.1] A=A.
% 275.34/275.55  >>>> Starting back demodulation with 101.
% 275.34/275.55  >>>> Starting back demodulation with 103.
% 275.34/275.55  >>>> Starting back demodulation with 105.
% 275.34/275.55  >>>> Starting back demodulation with 107.
% 275.34/275.55  >>>> Starting back demodulation with 109.
% 275.34/275.55  >>>> Starting back demodulation with 111.
% 275.34/275.55  >>>> Starting back demodulation with 113.
% 275.34/275.55  >>>> Starting back demodulation with 115.
% 275.34/275.55  >>>> Starting back demodulation with 117.
% 275.34/275.55  >>>> Starting back demodulation with 119.
% 275.34/275.55    Following clause subsumed by 120 during input processing: 0 [copy,120,flip.1] plus(A,B)=plus(B,A).
% 275.34/275.55  
% 275.34/275.55  ======= end of input processing =======
% 275.34/275.55  
% 275.34/275.55  =========== start of search ===========
% 275.34/275.55  
% 275.34/275.55  
% 275.34/275.55  Resetting weight limit to 9.
% 275.34/275.55  
% 275.34/275.55  
% 275.34/275.55  Resetting weight limit to 9.
% 275.34/275.55  
% 275.34/275.55  sos_size=3937
% 275.34/275.55  
% 275.34/275.55  
% 275.34/275.55  Resetting weight limit to 8.
% 275.34/275.55  
% 275.34/275.55  
% 275.34/275.55  Resetting weight limit to 8.
% 275.34/275.55  
% 275.34/275.55  sos_size=4632
% 275.34/275.55  
% 275.34/275.55  
% 275.34/275.55  Resetting weight limit to 7.
% 275.34/275.55  
% 275.34/275.55  
% 275.34/275.55  Resetting weight limit to 7.
% 275.34/275.55  
% 275.34/275.55  sos_size=4742
% 275.34/275.55  
% 275.34/275.55  
% 275.34/275.55  Resetting weight limit to 6.
% 275.34/275.55  
% 275.34/275.55  
% 275.34/275.55  Resetting weight limit to 6.
% 275.34/275.55  
% 275.34/275.55  sos_size=4503
% 275.34/275.55  
% 275.34/275.55  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 275.34/275.55  
% 275.34/275.55  ----> UNIT CONFLICT at 273.42 sec ----> 7442 [binary,7441.1,97.1] $F.
% 275.34/275.55  
% 275.34/275.55  Length of proof is 26.  Level of proof is 11.
% 275.34/275.55  
% 275.34/275.55  ---------------- PROOF ----------------
% 275.34/275.55  % SZS status Theorem
% 275.34/275.55  % SZS output start Refutation
% See solution above
% 275.34/275.55  ------------ end of proof -------------
% 275.34/275.55  
% 275.34/275.55  
% 275.34/275.55  Search stopped by max_proofs option.
% 275.34/275.55  
% 275.34/275.55  
% 275.34/275.55  Search stopped by max_proofs option.
% 275.34/275.55  
% 275.34/275.55  ============ end of search ============
% 275.34/275.55  
% 275.34/275.55  -------------- statistics -------------
% 275.34/275.55  clauses given               2860
% 275.34/275.55  clauses generated        6684681
% 275.34/275.55  clauses kept                7424
% 275.34/275.55  clauses forward subsumed   15890
% 275.34/275.55  clauses back subsumed        941
% 275.34/275.55  Kbytes malloced             6835
% 275.34/275.55  
% 275.34/275.55  ----------- times (seconds) -----------
% 275.34/275.55  user CPU time        273.42          (0 hr, 4 min, 33 sec)
% 275.34/275.55  system CPU time        0.02          (0 hr, 0 min, 0 sec)
% 275.34/275.55  wall-clock time      276             (0 hr, 4 min, 36 sec)
% 275.34/275.55  
% 275.34/275.55  That finishes the proof of the theorem.
% 275.34/275.55  
% 275.34/275.55  Process 2759 finished Wed Jul 27 04:13:56 2022
% 275.34/275.55  Otter interrupted
% 275.34/275.55  PROOF FOUND
%------------------------------------------------------------------------------