TSTP Solution File: CSR018+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CSR018+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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 56.90s 57.09s
% Output : Refutation 56.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 22
% Syntax : Number of clauses : 42 ( 21 unt; 10 nHn; 34 RR)
% Number of literals : 81 ( 27 equ; 32 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 : 47 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ stoppedIn(A,B,C)
| less(dollar_f1(A,B,C),C) ),
file('CSR018+1.p',unknown),
[] ).
cnf(5,axiom,
( stoppedIn(A,B,C)
| ~ happens(D,E)
| ~ less(A,E)
| ~ less(E,C)
| ~ terminates(D,B,E) ),
file('CSR018+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ happens(A,B)
| ~ initiates(A,C,B)
| holdsAt(C,plus(B,n1)) ),
file('CSR018+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ initiates(A,B,C)
| A = push
| B = backwards
| happens(push,C) ),
file('CSR018+1.p',unknown),
[] ).
cnf(39,axiom,
( initiates(A,B,C)
| A != pull
| B != backwards
| happens(push,C) ),
file('CSR018+1.p',unknown),
[] ).
cnf(40,axiom,
( initiates(A,B,C)
| A != pull
| B != spinning
| ~ happens(push,C) ),
file('CSR018+1.p',unknown),
[] ).
cnf(52,axiom,
( terminates(A,B,C)
| A != pull
| B != backwards
| ~ happens(push,C) ),
file('CSR018+1.p',unknown),
[] ).
cnf(58,axiom,
( ~ happens(A,B)
| B = n0
| A = pull
| B = n2 ),
file('CSR018+1.p',unknown),
[] ).
cnf(61,axiom,
( happens(A,B)
| A != pull
| B != n1 ),
file('CSR018+1.p',unknown),
[] ).
cnf(64,axiom,
push != pull,
file('CSR018+1.p',unknown),
[] ).
cnf(68,axiom,
spinning != backwards,
file('CSR018+1.p',unknown),
[] ).
cnf(71,axiom,
( less_or_e_qual(A,B)
| A != B ),
file('CSR018+1.p',unknown),
[] ).
cnf(72,axiom,
~ less(A,n0),
file('CSR018+1.p',unknown),
[] ).
cnf(74,axiom,
( less(A,n1)
| ~ less_or_e_qual(A,n0) ),
file('CSR018+1.p',unknown),
[] ).
cnf(76,axiom,
( less(A,n2)
| ~ less_or_e_qual(A,n1) ),
file('CSR018+1.p',unknown),
[] ).
cnf(91,axiom,
( ~ less(A,B)
| ~ less(B,A) ),
file('CSR018+1.p',unknown),
[] ).
cnf(92,axiom,
( ~ less(A,B)
| B != A ),
file('CSR018+1.p',unknown),
[] ).
cnf(97,axiom,
~ holdsAt(backwards,n2),
file('CSR018+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('CSR018+1.p',unknown),
[] ).
cnf(102,axiom,
plus(n0,n1) = n1,
file('CSR018+1.p',unknown),
[] ).
cnf(109,axiom,
plus(n1,n1) = n2,
file('CSR018+1.p',unknown),
[] ).
cnf(121,axiom,
( less(A,B)
| less(B,A)
| B = A ),
file('CSR018+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(131,plain,
( initiates(pull,backwards,A)
| happens(push,A) ),
inference(hyper,[status(thm)],[99,39,99]),
[iquote('hyper,99,39,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(365,plain,
( happens(push,n1)
| ~ initiates(pull,A,B)
| A = backwards
| happens(push,B) ),
inference(para_into,[status(thm),theory(equality)],[125,28]),
[iquote('para_into,125.1.1,28.2.1')] ).
cnf(4399,plain,
( less(A,n1)
| less(n0,A) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[121,141]),72]),
[iquote('para_from,121.3.1,141.1.1,unit_del,72')] ).
cnf(4403,plain,
( plus(A,n1) = n1
| less(n0,A) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[121,102]),72]),
[iquote('para_from,121.3.1,102.1.1.1,unit_del,72')] ).
cnf(4601,plain,
( initiates(pull,backwards,A)
| initiates(pull,spinning,A) ),
inference(hyper,[status(thm)],[131,40,99,99]),
[iquote('hyper,131,40,99,99')] ).
cnf(6149,plain,
initiates(pull,spinning,n1),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[4601,21,125]),109]),97]),
[iquote('hyper,4601,21,125,demod,109,unit_del,97')] ).
cnf(6151,plain,
happens(push,n1),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[6149,365]),68])]),
[iquote('hyper,6149,365,unit_del,68,factor_simp')] ).
cnf(6187,plain,
( n1 = n0
| n2 = n1 ),
inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[6151,58]),64])]),
[iquote('hyper,6151,58,unit_del,64,flip.2')] ).
cnf(6188,plain,
terminates(pull,backwards,n1),
inference(hyper,[status(thm)],[6151,52,99,99]),
[iquote('hyper,6151,52,99,99')] ).
cnf(6224,plain,
stoppedIn(n0,backwards,n2),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[6188,5,125,4399,140]),98]),
[iquote('hyper,6188,5,125,4399,140,unit_del,98')] ).
cnf(6230,plain,
less(dollar_f1(n0,backwards,n2),n2),
inference(hyper,[status(thm)],[6224,3]),
[iquote('hyper,6224,3')] ).
cnf(6237,plain,
n2 = n1,
inference(factor_simp,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[6187,92,4403]),109])]),
[iquote('hyper,6187,92,4403,demod,109,factor_simp')] ).
cnf(6239,plain,
n1 = n0,
inference(hyper,[status(thm)],[6187,92,140]),
[iquote('hyper,6187,92,140')] ).
cnf(6244,plain,
less(dollar_f1(n0,backwards,n0),n0),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[6230]),6237,6239,6237,6239]),
[iquote('back_demod,6230,demod,6237,6239,6237,6239')] ).
cnf(6245,plain,
$false,
inference(binary,[status(thm)],[6244,72]),
[iquote('binary,6244.1,72.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR018+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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 04:31:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.11/2.31 ----- Otter 3.3f, August 2004 -----
% 2.11/2.31 The process was started by sandbox on n025.cluster.edu,
% 2.11/2.31 Wed Jul 27 04:31:15 2022
% 2.11/2.31 The command was "./otter". The process ID is 18137.
% 2.11/2.31
% 2.11/2.31 set(prolog_style_variables).
% 2.11/2.31 set(auto).
% 2.11/2.31 dependent: set(auto1).
% 2.11/2.31 dependent: set(process_input).
% 2.11/2.31 dependent: clear(print_kept).
% 2.11/2.31 dependent: clear(print_new_demod).
% 2.11/2.31 dependent: clear(print_back_demod).
% 2.11/2.31 dependent: clear(print_back_sub).
% 2.11/2.31 dependent: set(control_memory).
% 2.11/2.31 dependent: assign(max_mem, 12000).
% 2.11/2.31 dependent: assign(pick_given_ratio, 4).
% 2.11/2.31 dependent: assign(stats_level, 1).
% 2.11/2.31 dependent: assign(max_seconds, 10800).
% 2.11/2.31 clear(print_given).
% 2.11/2.31
% 2.11/2.31 formula_list(usable).
% 2.11/2.31 all A (A=A).
% 2.11/2.31 all Time1 Fluent Time2 (stoppedIn(Time1,Fluent,Time2)<-> (exists Event Time (happens(Event,Time)&less(Time1,Time)&less(Time,Time2)&terminates(Event,Fluent,Time)))).
% 2.11/2.31 all Time1 Time2 Fluent (startedIn(Time1,Fluent,Time2)<-> (exists Event Time (happens(Event,Time)&less(Time1,Time)&less(Time,Time2)&initiates(Event,Fluent,Time)))).
% 2.11/2.31 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))).
% 2.11/2.31 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))).
% 2.11/2.31 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))).
% 2.11/2.31 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))).
% 2.11/2.31 all Fluent Time (releasedAt(Fluent,Time)& -(exists Event (happens(Event,Time)& (initiates(Event,Fluent,Time)|terminates(Event,Fluent,Time))))->releasedAt(Fluent,plus(Time,n1))).
% 2.11/2.31 all Fluent Time (-releasedAt(Fluent,Time)& -(exists Event (happens(Event,Time)&releases(Event,Fluent,Time)))-> -releasedAt(Fluent,plus(Time,n1))).
% 2.11/2.31 all Event Time Fluent (happens(Event,Time)&initiates(Event,Fluent,Time)->holdsAt(Fluent,plus(Time,n1))).
% 2.11/2.31 all Event Time Fluent (happens(Event,Time)&terminates(Event,Fluent,Time)-> -holdsAt(Fluent,plus(Time,n1))).
% 2.11/2.31 all Event Time Fluent (happens(Event,Time)&releases(Event,Fluent,Time)->releasedAt(Fluent,plus(Time,n1))).
% 2.11/2.31 all Event Time Fluent (happens(Event,Time)& (initiates(Event,Fluent,Time)|terminates(Event,Fluent,Time))-> -releasedAt(Fluent,plus(Time,n1))).
% 2.11/2.31 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)).
% 2.11/2.31 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)).
% 2.11/2.31 all Event Fluent Time (-releases(Event,Fluent,Time)).
% 2.11/2.31 all Event Time (happens(Event,Time)<->Event=push&Time=n0|Event=pull&Time=n1|Event=pull&Time=n2|Event=push&Time=n2).
% 2.11/2.31 push!=pull.
% 2.11/2.31 forwards!=backwards.
% 2.11/2.31 forwards!=spinning.
% 2.11/2.31 spinning!=backwards.
% 2.11/2.31 plus(n0,n0)=n0.
% 2.11/2.31 plus(n0,n1)=n1.
% 2.11/2.31 plus(n0,n2)=n2.
% 2.11/2.31 plus(n0,n3)=n3.
% 2.11/2.31 plus(n1,n1)=n2.
% 2.11/2.31 plus(n1,n2)=n3.
% 2.11/2.31 plus(n1,n3)=n4.
% 2.11/2.31 plus(n2,n2)=n4.
% 2.11/2.31 plus(n2,n3)=n5.
% 2.11/2.31 plus(n3,n3)=n6.
% 2.11/2.31 all X Y (plus(X,Y)=plus(Y,X)).
% 2.11/2.31 all X Y (less_or_e_qual(X,Y)<->less(X,Y)|X=Y).
% 2.11/2.31 -(exists X less(X,n0)).
% 2.11/2.31 all X (less(X,n1)<->less_or_e_qual(X,n0)).
% 2.11/2.31 all X (less(X,n2)<->less_or_e_qual(X,n1)).
% 2.11/2.31 all X (less(X,n3)<->less_or_e_qual(X,n2)).
% 2.11/2.31 all X (less(X,n4)<->less_or_e_qual(X,n3)).
% 2.11/2.31 all X (less(X,n5)<->less_or_e_qual(X,n4)).
% 2.11/2.31 all X (less(X,n6)<->less_or_e_qual(X,n5)).
% 2.11/2.31 all X (less(X,n7)<->less_or_e_qual(X,n6)).
% 2.11/2.31 all X (less(X,n8)<->less_or_e_qual(X,n7)).
% 2.11/2.31 all X (less(X,n9)<->less_or_e_qual(X,n8)).
% 2.11/2.31 all X Y (less(X,Y)<-> -less(Y,X)&Y!=X).
% 2.11/2.31 -holdsAt(forwards,n0).
% 2.11/2.31 -holdsAt(backwards,n0).
% 2.11/2.31 -holdsAt(spinning,n0).
% 2.11/2.31 all Fluent Time (-releasedAt(Fluent,Time)).
% 2.11/2.31 -holdsAt(backwards,n2).
% 2.11/2.31 end_of_list.
% 2.11/2.31
% 2.11/2.31 -------> usable clausifies to:
% 2.11/2.31
% 2.11/2.31 list(usable).
% 2.11/2.31 0 [] A=A.
% 2.11/2.31 0 [] -stoppedIn(Time1,Fluent,Time2)|happens($f2(Time1,Fluent,Time2),$f1(Time1,Fluent,Time2)).
% 2.11/2.31 0 [] -stoppedIn(Time1,Fluent,Time2)|less(Time1,$f1(Time1,Fluent,Time2)).
% 2.11/2.31 0 [] -stoppedIn(Time1,Fluent,Time2)|less($f1(Time1,Fluent,Time2),Time2).
% 2.11/2.31 0 [] -stoppedIn(Time1,Fluent,Time2)|terminates($f2(Time1,Fluent,Time2),Fluent,$f1(Time1,Fluent,Time2)).
% 2.11/2.31 0 [] stoppedIn(Time1,Fluent,Time2)| -happens(Event,Time)| -less(Time1,Time)| -less(Time,Time2)| -terminates(Event,Fluent,Time).
% 2.11/2.31 0 [] -startedIn(Time1,Fluent,Time2)|happens($f4(Time1,Time2,Fluent),$f3(Time1,Time2,Fluent)).
% 2.11/2.31 0 [] -startedIn(Time1,Fluent,Time2)|less(Time1,$f3(Time1,Time2,Fluent)).
% 2.11/2.31 0 [] -startedIn(Time1,Fluent,Time2)|less($f3(Time1,Time2,Fluent),Time2).
% 2.11/2.31 0 [] -startedIn(Time1,Fluent,Time2)|initiates($f4(Time1,Time2,Fluent),Fluent,$f3(Time1,Time2,Fluent)).
% 2.11/2.31 0 [] startedIn(Time1,Fluent,Time2)| -happens(Event,Time)| -less(Time1,Time)| -less(Time,Time2)| -initiates(Event,Fluent,Time).
% 2.11/2.31 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)).
% 2.11/2.31 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)).
% 2.11/2.31 0 [] -holdsAt(Fluent,Time)|releasedAt(Fluent,plus(Time,n1))|happens($f5(Fluent,Time),Time)|holdsAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] -holdsAt(Fluent,Time)|releasedAt(Fluent,plus(Time,n1))|terminates($f5(Fluent,Time),Fluent,Time)|holdsAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] holdsAt(Fluent,Time)|releasedAt(Fluent,plus(Time,n1))|happens($f6(Fluent,Time),Time)| -holdsAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] holdsAt(Fluent,Time)|releasedAt(Fluent,plus(Time,n1))|initiates($f6(Fluent,Time),Fluent,Time)| -holdsAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] -releasedAt(Fluent,Time)|happens($f7(Fluent,Time),Time)|releasedAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] -releasedAt(Fluent,Time)|initiates($f7(Fluent,Time),Fluent,Time)|terminates($f7(Fluent,Time),Fluent,Time)|releasedAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] releasedAt(Fluent,Time)|happens($f8(Fluent,Time),Time)| -releasedAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] releasedAt(Fluent,Time)|releases($f8(Fluent,Time),Fluent,Time)| -releasedAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] -happens(Event,Time)| -initiates(Event,Fluent,Time)|holdsAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] -happens(Event,Time)| -terminates(Event,Fluent,Time)| -holdsAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] -happens(Event,Time)| -releases(Event,Fluent,Time)|releasedAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] -happens(Event,Time)| -initiates(Event,Fluent,Time)| -releasedAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] -happens(Event,Time)| -terminates(Event,Fluent,Time)| -releasedAt(Fluent,plus(Time,n1)).
% 2.11/2.31 0 [] -initiates(Event,Fluent,Time)|Event=push|Event=pull.
% 2.11/2.31 0 [] -initiates(Event,Fluent,Time)|Event=push|Fluent=backwards|Fluent=spinning.
% 2.11/2.31 0 [] -initiates(Event,Fluent,Time)|Event=push|Fluent=backwards|happens(push,Time).
% 2.11/2.31 0 [] -initiates(Event,Fluent,Time)|Event=push| -happens(push,Time)|Fluent=spinning.
% 2.11/2.31 0 [] -initiates(Event,Fluent,Time)|Fluent=forwards|Event=pull.
% 2.11/2.31 0 [] -initiates(Event,Fluent,Time)|Fluent=forwards|Fluent=backwards|Fluent=spinning.
% 2.11/2.31 0 [] -initiates(Event,Fluent,Time)|Fluent=forwards|Fluent=backwards|happens(push,Time).
% 2.11/2.31 0 [] -initiates(Event,Fluent,Time)|Fluent=forwards| -happens(push,Time)|Fluent=spinning.
% 2.11/2.31 0 [] -initiates(Event,Fluent,Time)| -happens(pull,Time)|Event=pull.
% 2.11/2.31 0 [] -initiates(Event,Fluent,Time)| -happens(pull,Time)|Fluent=backwards|Fluent=spinning.
% 2.11/2.31 0 [] -initiates(Event,Fluent,Time)| -happens(pull,Time)|Fluent=backwards|happens(push,Time).
% 2.11/2.31 0 [] -initiates(Event,Fluent,Time)| -happens(pull,Time)| -happens(push,Time)|Fluent=spinning.
% 2.11/2.31 0 [] initiates(Event,Fluent,Time)|Event!=push|Fluent!=forwards|happens(pull,Time).
% 2.11/2.31 0 [] initiates(Event,Fluent,Time)|Event!=pull|Fluent!=backwards|happens(push,Time).
% 2.11/2.31 0 [] initiates(Event,Fluent,Time)|Event!=pull|Fluent!=spinning| -happens(push,Time).
% 2.11/2.32 0 [] -terminates(Event,Fluent,Time)|Event=push|Event=pull.
% 2.11/2.32 0 [] -terminates(Event,Fluent,Time)|Event=push|Fluent=forwards|Fluent=backwards| -happens(push,Time).
% 2.11/2.32 0 [] -terminates(Event,Fluent,Time)|Event=push|Fluent=forwards|happens(push,Time)|Fluent=spinning.
% 2.11/2.32 0 [] -terminates(Event,Fluent,Time)|Fluent=backwards|Event=pull|Fluent=spinning.
% 2.11/2.32 0 [] -terminates(Event,Fluent,Time)|Fluent=backwards|Fluent=forwards|Fluent=spinning.
% 2.11/2.32 0 [] -terminates(Event,Fluent,Time)|Fluent=backwards|Fluent=forwards| -happens(pull,Time)| -happens(push,Time).
% 2.11/2.32 0 [] -terminates(Event,Fluent,Time)| -happens(pull,Time)|Event=pull.
% 2.11/2.32 0 [] -terminates(Event,Fluent,Time)| -happens(pull,Time)|Fluent=forwards|happens(push,Time)|Fluent=spinning.
% 2.11/2.32 0 [] terminates(Event,Fluent,Time)|Event!=push|Fluent!=backwards|happens(pull,Time).
% 2.11/2.32 0 [] terminates(Event,Fluent,Time)|Event!=pull|Fluent!=forwards|happens(push,Time).
% 2.11/2.32 0 [] terminates(Event,Fluent,Time)|Event!=pull|Fluent!=forwards| -happens(push,Time).
% 2.11/2.32 0 [] terminates(Event,Fluent,Time)|Event!=pull|Fluent!=backwards| -happens(push,Time).
% 2.11/2.32 0 [] terminates(Event,Fluent,Time)|Event!=push|Fluent!=spinning|happens(pull,Time).
% 2.11/2.32 0 [] terminates(Event,Fluent,Time)|Event!=pull|Fluent!=spinning|happens(push,Time).
% 2.11/2.32 0 [] -releases(Event,Fluent,Time).
% 2.11/2.32 0 [] -happens(Event,Time)|Event=push|Event=pull.
% 2.11/2.32 0 [] -happens(Event,Time)|Event=push|Time=n1|Time=n2.
% 2.11/2.32 0 [] -happens(Event,Time)|Time=n0|Event=pull|Time=n2.
% 2.11/2.32 0 [] -happens(Event,Time)|Time=n0|Time=n1|Time=n2.
% 2.11/2.32 0 [] happens(Event,Time)|Event!=push|Time!=n0.
% 2.11/2.32 0 [] happens(Event,Time)|Event!=pull|Time!=n1.
% 2.11/2.32 0 [] happens(Event,Time)|Event!=pull|Time!=n2.
% 2.11/2.32 0 [] happens(Event,Time)|Event!=push|Time!=n2.
% 2.11/2.32 0 [] push!=pull.
% 2.11/2.32 0 [] forwards!=backwards.
% 2.11/2.32 0 [] forwards!=spinning.
% 2.11/2.32 0 [] spinning!=backwards.
% 2.11/2.32 0 [] plus(n0,n0)=n0.
% 2.11/2.32 0 [] plus(n0,n1)=n1.
% 2.11/2.32 0 [] plus(n0,n2)=n2.
% 2.11/2.32 0 [] plus(n0,n3)=n3.
% 2.11/2.32 0 [] plus(n1,n1)=n2.
% 2.11/2.32 0 [] plus(n1,n2)=n3.
% 2.11/2.32 0 [] plus(n1,n3)=n4.
% 2.11/2.32 0 [] plus(n2,n2)=n4.
% 2.11/2.32 0 [] plus(n2,n3)=n5.
% 2.11/2.32 0 [] plus(n3,n3)=n6.
% 2.11/2.32 0 [] plus(X,Y)=plus(Y,X).
% 2.11/2.32 0 [] -less_or_e_qual(X,Y)|less(X,Y)|X=Y.
% 2.11/2.32 0 [] less_or_e_qual(X,Y)| -less(X,Y).
% 2.11/2.32 0 [] less_or_e_qual(X,Y)|X!=Y.
% 2.11/2.32 0 [] -less(X,n0).
% 2.11/2.32 0 [] -less(X,n1)|less_or_e_qual(X,n0).
% 2.11/2.32 0 [] less(X,n1)| -less_or_e_qual(X,n0).
% 2.11/2.32 0 [] -less(X,n2)|less_or_e_qual(X,n1).
% 2.11/2.32 0 [] less(X,n2)| -less_or_e_qual(X,n1).
% 2.11/2.32 0 [] -less(X,n3)|less_or_e_qual(X,n2).
% 2.11/2.32 0 [] less(X,n3)| -less_or_e_qual(X,n2).
% 2.11/2.32 0 [] -less(X,n4)|less_or_e_qual(X,n3).
% 2.11/2.32 0 [] less(X,n4)| -less_or_e_qual(X,n3).
% 2.11/2.32 0 [] -less(X,n5)|less_or_e_qual(X,n4).
% 2.11/2.32 0 [] less(X,n5)| -less_or_e_qual(X,n4).
% 2.11/2.32 0 [] -less(X,n6)|less_or_e_qual(X,n5).
% 2.11/2.32 0 [] less(X,n6)| -less_or_e_qual(X,n5).
% 2.11/2.32 0 [] -less(X,n7)|less_or_e_qual(X,n6).
% 2.11/2.32 0 [] less(X,n7)| -less_or_e_qual(X,n6).
% 2.11/2.32 0 [] -less(X,n8)|less_or_e_qual(X,n7).
% 2.11/2.32 0 [] less(X,n8)| -less_or_e_qual(X,n7).
% 2.11/2.32 0 [] -less(X,n9)|less_or_e_qual(X,n8).
% 2.11/2.32 0 [] less(X,n9)| -less_or_e_qual(X,n8).
% 2.11/2.32 0 [] -less(X,Y)| -less(Y,X).
% 2.11/2.32 0 [] -less(X,Y)|Y!=X.
% 2.11/2.32 0 [] less(X,Y)|less(Y,X)|Y=X.
% 2.11/2.32 0 [] -holdsAt(forwards,n0).
% 2.11/2.32 0 [] -holdsAt(backwards,n0).
% 2.11/2.32 0 [] -holdsAt(spinning,n0).
% 2.11/2.32 0 [] -releasedAt(Fluent,Time).
% 2.11/2.32 0 [] -holdsAt(backwards,n2).
% 2.11/2.32 end_of_list.
% 2.11/2.32
% 2.11/2.32 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 2.11/2.32
% 2.11/2.32 This ia a non-Horn set with equality. The strategy will be
% 2.11/2.32 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.11/2.32 deletion, with positive clauses in sos and nonpositive
% 2.11/2.32 clauses in usable.
% 2.11/2.32
% 2.11/2.32 dependent: set(knuth_bendix).
% 2.11/2.32 dependent: set(anl_eq).
% 2.11/2.32 dependent: set(para_from).
% 2.11/2.32 dependent: set(para_into).
% 2.11/2.32 dependent: clear(para_from_right).
% 2.11/2.32 dependent: clear(para_into_right).
% 2.11/2.32 dependent: set(para_from_vars).
% 2.11/2.32 dependent: set(eq_units_both_ways).
% 2.11/2.32 dependent: set(dynamic_demod_all).
% 2.11/2.32 dependent: set(dynamic_demod).
% 2.11/2.32 dependent: set(order_eq).
% 2.11/2.32 dependent: set(back_demod).
% 2.11/2.32 dependent: set(lrpo).
% 2.11/2.32 dependent: set(hyper_res).
% 2.11/2.32 dependent: set(unit_deletion).
% 2.11/2.32 dependent: set(factor).
% 2.11/2.32
% 2.11/2.32 ------------> process usable:
% 2.11/2.32 ** KEPT (pick-wt=13): 1 [] -stoppedIn(A,B,C)|happens($f2(A,B,C),$f1(A,B,C)).
% 2.11/2.32 ** KEPT (pick-wt=10): 2 [] -stoppedIn(A,B,C)|less(A,$f1(A,B,C)).
% 2.11/2.32 ** KEPT (pick-wt=10): 3 [] -stoppedIn(A,B,C)|less($f1(A,B,C),C).
% 2.11/2.32 ** KEPT (pick-wt=14): 4 [] -stoppedIn(A,B,C)|terminates($f2(A,B,C),B,$f1(A,B,C)).
% 2.11/2.32 ** KEPT (pick-wt=17): 5 [] stoppedIn(A,B,C)| -happens(D,E)| -less(A,E)| -less(E,C)| -terminates(D,B,E).
% 2.11/2.32 ** KEPT (pick-wt=13): 6 [] -startedIn(A,B,C)|happens($f4(A,C,B),$f3(A,C,B)).
% 2.11/2.32 ** KEPT (pick-wt=10): 7 [] -startedIn(A,B,C)|less(A,$f3(A,C,B)).
% 2.11/2.32 ** KEPT (pick-wt=10): 8 [] -startedIn(A,B,C)|less($f3(A,C,B),C).
% 2.11/2.32 ** KEPT (pick-wt=14): 9 [] -startedIn(A,B,C)|initiates($f4(A,C,B),B,$f3(A,C,B)).
% 2.11/2.32 ** KEPT (pick-wt=17): 10 [] startedIn(A,B,C)| -happens(D,E)| -less(A,E)| -less(E,C)| -initiates(D,B,E).
% 2.11/2.32 ** 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)).
% 2.11/2.32 ** 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)).
% 2.11/2.32 ** KEPT (pick-wt=18): 13 [] -holdsAt(A,B)|releasedAt(A,plus(B,n1))|happens($f5(A,B),B)|holdsAt(A,plus(B,n1)).
% 2.11/2.32 ** KEPT (pick-wt=19): 14 [] -holdsAt(A,B)|releasedAt(A,plus(B,n1))|terminates($f5(A,B),A,B)|holdsAt(A,plus(B,n1)).
% 2.11/2.32 ** KEPT (pick-wt=18): 15 [] holdsAt(A,B)|releasedAt(A,plus(B,n1))|happens($f6(A,B),B)| -holdsAt(A,plus(B,n1)).
% 2.11/2.32 ** KEPT (pick-wt=19): 16 [] holdsAt(A,B)|releasedAt(A,plus(B,n1))|initiates($f6(A,B),A,B)| -holdsAt(A,plus(B,n1)).
% 2.11/2.32 ** KEPT (pick-wt=13): 17 [] -releasedAt(A,B)|happens($f7(A,B),B)|releasedAt(A,plus(B,n1)).
% 2.11/2.32 ** 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)).
% 2.11/2.32 ** KEPT (pick-wt=13): 19 [] releasedAt(A,B)|happens($f8(A,B),B)| -releasedAt(A,plus(B,n1)).
% 2.11/2.32 ** KEPT (pick-wt=14): 20 [] releasedAt(A,B)|releases($f8(A,B),A,B)| -releasedAt(A,plus(B,n1)).
% 2.11/2.32 ** KEPT (pick-wt=12): 21 [] -happens(A,B)| -initiates(A,C,B)|holdsAt(C,plus(B,n1)).
% 2.11/2.32 ** KEPT (pick-wt=12): 22 [] -happens(A,B)| -terminates(A,C,B)| -holdsAt(C,plus(B,n1)).
% 2.11/2.32 ** KEPT (pick-wt=12): 23 [] -happens(A,B)| -releases(A,C,B)|releasedAt(C,plus(B,n1)).
% 2.11/2.32 ** KEPT (pick-wt=12): 24 [] -happens(A,B)| -initiates(A,C,B)| -releasedAt(C,plus(B,n1)).
% 2.11/2.32 ** KEPT (pick-wt=12): 25 [] -happens(A,B)| -terminates(A,C,B)| -releasedAt(C,plus(B,n1)).
% 2.11/2.32 ** KEPT (pick-wt=10): 26 [] -initiates(A,B,C)|A=push|A=pull.
% 2.11/2.32 ** KEPT (pick-wt=13): 27 [] -initiates(A,B,C)|A=push|B=backwards|B=spinning.
% 2.11/2.32 ** KEPT (pick-wt=13): 28 [] -initiates(A,B,C)|A=push|B=backwards|happens(push,C).
% 2.11/2.32 ** KEPT (pick-wt=13): 29 [] -initiates(A,B,C)|A=push| -happens(push,C)|B=spinning.
% 2.11/2.32 ** KEPT (pick-wt=10): 30 [] -initiates(A,B,C)|B=forwards|A=pull.
% 2.11/2.32 ** KEPT (pick-wt=13): 31 [] -initiates(A,B,C)|B=forwards|B=backwards|B=spinning.
% 2.11/2.32 ** KEPT (pick-wt=13): 32 [] -initiates(A,B,C)|B=forwards|B=backwards|happens(push,C).
% 2.11/2.32 ** KEPT (pick-wt=13): 33 [] -initiates(A,B,C)|B=forwards| -happens(push,C)|B=spinning.
% 2.11/2.32 ** KEPT (pick-wt=10): 34 [] -initiates(A,B,C)| -happens(pull,C)|A=pull.
% 2.11/2.32 ** KEPT (pick-wt=13): 35 [] -initiates(A,B,C)| -happens(pull,C)|B=backwards|B=spinning.
% 2.11/2.32 ** KEPT (pick-wt=13): 36 [] -initiates(A,B,C)| -happens(pull,C)|B=backwards|happens(push,C).
% 2.11/2.32 ** KEPT (pick-wt=13): 37 [] -initiates(A,B,C)| -happens(pull,C)| -happens(push,C)|B=spinning.
% 2.11/2.32 ** KEPT (pick-wt=13): 38 [] initiates(A,B,C)|A!=push|B!=forwards|happens(pull,C).
% 2.11/2.32 ** KEPT (pick-wt=13): 39 [] initiates(A,B,C)|A!=pull|B!=backwards|happens(push,C).
% 2.11/2.32 ** KEPT (pick-wt=13): 40 [] initiates(A,B,C)|A!=pull|B!=spinning| -happens(push,C).
% 2.11/2.32 ** KEPT (pick-wt=10): 41 [] -terminates(A,B,C)|A=push|A=pull.
% 2.11/2.32 ** KEPT (pick-wt=16): 42 [] -terminates(A,B,C)|A=push|B=forwards|B=backwards| -happens(push,C).
% 2.11/2.32 ** KEPT (pick-wt=16): 43 [] -terminates(A,B,C)|A=push|B=forwards|happens(push,C)|B=spinning.
% 2.11/2.32 ** KEPT (pick-wt=13): 44 [] -terminates(A,B,C)|B=backwards|A=pull|B=spinning.
% 2.11/2.32 ** KEPT (pick-wt=13): 45 [] -terminates(A,B,C)|B=backwards|B=forwards|B=spinning.
% 2.11/2.32 ** KEPT (pick-wt=16): 46 [] -terminates(A,B,C)|B=backwards|B=forwards| -happens(pull,C)| -happens(push,C).
% 2.11/2.32 ** KEPT (pick-wt=10): 47 [] -terminates(A,B,C)| -happens(pull,C)|A=pull.
% 2.11/2.32 ** KEPT (pick-wt=16): 48 [] -terminates(A,B,C)| -happens(pull,C)|B=forwards|happens(push,C)|B=spinning.
% 2.11/2.32 ** KEPT (pick-wt=13): 49 [] terminates(A,B,C)|A!=push|B!=backwards|happens(pull,C).
% 2.11/2.32 ** KEPT (pick-wt=13): 50 [] terminates(A,B,C)|A!=pull|B!=forwards|happens(push,C).
% 2.11/2.32 ** KEPT (pick-wt=13): 51 [] terminates(A,B,C)|A!=pull|B!=forwards| -happens(push,C).
% 2.11/2.32 ** KEPT (pick-wt=13): 52 [] terminates(A,B,C)|A!=pull|B!=backwards| -happens(push,C).
% 2.11/2.32 ** KEPT (pick-wt=13): 53 [] terminates(A,B,C)|A!=push|B!=spinning|happens(pull,C).
% 2.11/2.32 ** KEPT (pick-wt=13): 54 [] terminates(A,B,C)|A!=pull|B!=spinning|happens(push,C).
% 2.11/2.32 ** KEPT (pick-wt=4): 55 [] -releases(A,B,C).
% 2.11/2.32 ** KEPT (pick-wt=9): 56 [] -happens(A,B)|A=push|A=pull.
% 2.11/2.32 ** KEPT (pick-wt=12): 57 [] -happens(A,B)|A=push|B=n1|B=n2.
% 2.11/2.32 ** KEPT (pick-wt=12): 58 [] -happens(A,B)|B=n0|A=pull|B=n2.
% 2.11/2.32 ** KEPT (pick-wt=12): 59 [] -happens(A,B)|B=n0|B=n1|B=n2.
% 2.11/2.32 ** KEPT (pick-wt=9): 60 [] happens(A,B)|A!=push|B!=n0.
% 2.11/2.32 ** KEPT (pick-wt=9): 61 [] happens(A,B)|A!=pull|B!=n1.
% 2.11/2.32 ** KEPT (pick-wt=9): 62 [] happens(A,B)|A!=pull|B!=n2.
% 2.11/2.32 ** KEPT (pick-wt=9): 63 [] happens(A,B)|A!=push|B!=n2.
% 2.11/2.32 ** KEPT (pick-wt=3): 64 [] push!=pull.
% 2.11/2.32 ** KEPT (pick-wt=3): 65 [] forwards!=backwards.
% 2.11/2.32 ** KEPT (pick-wt=3): 67 [copy,66,flip.1] spinning!=forwards.
% 2.11/2.32 ** KEPT (pick-wt=3): 68 [] spinning!=backwards.
% 2.11/2.32 ** KEPT (pick-wt=9): 69 [] -less_or_e_qual(A,B)|less(A,B)|A=B.
% 2.11/2.32 ** KEPT (pick-wt=6): 70 [] less_or_e_qual(A,B)| -less(A,B).
% 2.11/2.32 ** KEPT (pick-wt=6): 71 [] less_or_e_qual(A,B)|A!=B.
% 2.11/2.32 ** KEPT (pick-wt=3): 72 [] -less(A,n0).
% 2.11/2.32 ** KEPT (pick-wt=6): 73 [] -less(A,n1)|less_or_e_qual(A,n0).
% 2.11/2.32 ** KEPT (pick-wt=6): 74 [] less(A,n1)| -less_or_e_qual(A,n0).
% 2.11/2.32 ** KEPT (pick-wt=6): 75 [] -less(A,n2)|less_or_e_qual(A,n1).
% 2.11/2.32 ** KEPT (pick-wt=6): 76 [] less(A,n2)| -less_or_e_qual(A,n1).
% 2.11/2.32 ** KEPT (pick-wt=6): 77 [] -less(A,n3)|less_or_e_qual(A,n2).
% 2.11/2.32 ** KEPT (pick-wt=6): 78 [] less(A,n3)| -less_or_e_qual(A,n2).
% 2.11/2.32 ** KEPT (pick-wt=6): 79 [] -less(A,n4)|less_or_e_qual(A,n3).
% 2.11/2.32 ** KEPT (pick-wt=6): 80 [] less(A,n4)| -less_or_e_qual(A,n3).
% 2.11/2.32 ** KEPT (pick-wt=6): 81 [] -less(A,n5)|less_or_e_qual(A,n4).
% 2.11/2.32 ** KEPT (pick-wt=6): 82 [] less(A,n5)| -less_or_e_qual(A,n4).
% 2.11/2.32 ** KEPT (pick-wt=6): 83 [] -less(A,n6)|less_or_e_qual(A,n5).
% 2.11/2.32 ** KEPT (pick-wt=6): 84 [] less(A,n6)| -less_or_e_qual(A,n5).
% 2.11/2.32 ** KEPT (pick-wt=6): 85 [] -less(A,n7)|less_or_e_qual(A,n6).
% 2.11/2.32 ** KEPT (pick-wt=6): 86 [] less(A,n7)| -less_or_e_qual(A,n6).
% 2.11/2.32 ** KEPT (pick-wt=6): 87 [] -less(A,n8)|less_or_e_qual(A,n7).
% 2.11/2.32 ** KEPT (pick-wt=6): 88 [] less(A,n8)| -less_or_e_qual(A,n7).
% 2.11/2.32 ** KEPT (pick-wt=6): 89 [] -less(A,n9)|less_or_e_qual(A,n8).
% 2.11/2.32 ** KEPT (pick-wt=6): 90 [] less(A,n9)| -less_or_e_qual(A,n8).
% 2.11/2.32 ** KEPT (pick-wt=6): 91 [] -less(A,B)| -less(B,A).
% 2.11/2.32 ** KEPT (pick-wt=6): 92 [] -less(A,B)|B!=A.
% 2.11/2.32 ** KEPT (pick-wt=3): 93 [] -holdsAt(forwards,n0).
% 2.11/2.32 ** KEPT (pick-wt=3): 94 [] -holdsAt(backwards,n0).
% 2.11/2.32 ** KEPT (pick-wt=3): 95 [] -holdsAt(spinning,n0).
% 2.11/2.32 ** KEPT (pick-wt=3): 96 [] -releasedAt(A,B).
% 2.11/2.32 ** KEPT (pick-wt=3): 97 [] -holdsAt(backwards,n2).
% 2.11/2.32 55 back subsumes 23.
% 2.11/2.32 96 back subsumes 25.
% 2.11/2.32 96 back subsumes 24.
% 2.11/2.32 96 back subsumes 20.
% 2.11/2.32 96 back subsumes 19.
% 2.11/2.32 96 back subsumes 18.
% 2.11/2.32 96 back subsumes 17.
% 2.11/2.32
% 2.11/2.32 ------------> process sos:
% 2.11/2.32 ** KEPT (pick-wt=3): 99 [] A=A.
% 2.11/2.32 ** KEPT (pick-wt=5): 100 [] plus(n0,n0)=n0.
% 2.11/2.32 ---> New Demodulator: 101 [new_demod,100] plus(n0,n0)=n0.
% 2.11/2.32 ** KEPT (pick-wt=5): 102 [] plus(n0,n1)=n1.
% 2.11/2.32 ---> New Demodulator: 103 [new_demod,102] plus(n0,n1)=n1.
% 2.11/2.32 ** KEPT (pick-wt=5): 104 [] plus(n0,n2)=n2.
% 2.11/2.32 ---> New Demodulator: 105 [new_demod,104] plus(n0,n2)=n2.
% 2.11/2.32 ** KEPT (pick-wt=5): 106 [] plus(n0,n3)=n3.
% 2.11/2.32 ---> New Demodulator: 107 [new_demod,106] plus(n0,n3)=n3.
% 2.11/2.32 ** KEPT (pick-wt=5): 108 [] plus(n1,n1)=n2.
% 2.11/2.32 ---> New Demodulator: 109 [new_demod,108] plus(n1,n1)=n2.
% 2.11/2.32 ** KEPT (pick-wt=5): 110 [] plus(n1,n2)=n3.
% 2.11/2.32 ---> New Demodulator: 111 [new_demod,110] plus(n1,n2)=n3.
% 2.11/2.32 ** KEPT (pick-wt=5): 112 [] plus(n1,n3)=n4.
% 2.11/2.32 ---> New Demodulator: 113 [new_demod,112] plus(n1,n3)=n4.
% 2.11/2.32 ** KEPT (pick-wt=5): 114 [] plus(n2,n2)=n4.
% 2.11/2.32 ---> New Demodulator: 115 [new_demod,114] plus(n2,n2)=n4.
% 2.11/2.32 ** KEPT (pick-wt=5): 116 [] plus(n2,n3)=n5.
% 2.11/2.32 ---> New Demodulator: 117 [new_demod,116] plus(n2,n3)=n5.
% 2.11/2.32 ** KEPT (pick-wt=5): 118 [] plus(n3,n3)=n6.
% 2.11/2.32 ---> New Demodulator: 119 [new_demod,118] plus(n3,n3)=n6.
% 56.90/57.09 ** KEPT (pick-wt=7): 120 [] plus(A,B)=plus(B,A).
% 56.90/57.09 ** KEPT (pick-wt=9): 121 [] less(A,B)|less(B,A)|B=A.
% 56.90/57.09 Following clause subsumed by 99 during input processing: 0 [copy,99,flip.1] A=A.
% 56.90/57.09 >>>> Starting back demodulation with 101.
% 56.90/57.09 >>>> Starting back demodulation with 103.
% 56.90/57.09 >>>> Starting back demodulation with 105.
% 56.90/57.09 >>>> Starting back demodulation with 107.
% 56.90/57.09 >>>> Starting back demodulation with 109.
% 56.90/57.09 >>>> Starting back demodulation with 111.
% 56.90/57.09 >>>> Starting back demodulation with 113.
% 56.90/57.09 >>>> Starting back demodulation with 115.
% 56.90/57.09 >>>> Starting back demodulation with 117.
% 56.90/57.09 >>>> Starting back demodulation with 119.
% 56.90/57.09 Following clause subsumed by 120 during input processing: 0 [copy,120,flip.1] plus(A,B)=plus(B,A).
% 56.90/57.09
% 56.90/57.09 ======= end of input processing =======
% 56.90/57.09
% 56.90/57.09 =========== start of search ===========
% 56.90/57.09
% 56.90/57.09
% 56.90/57.09 Resetting weight limit to 9.
% 56.90/57.09
% 56.90/57.09
% 56.90/57.09 Resetting weight limit to 9.
% 56.90/57.09
% 56.90/57.09 sos_size=3937
% 56.90/57.09
% 56.90/57.09
% 56.90/57.09 Resetting weight limit to 8.
% 56.90/57.09
% 56.90/57.09
% 56.90/57.09 Resetting weight limit to 8.
% 56.90/57.09
% 56.90/57.09 sos_size=4632
% 56.90/57.09
% 56.90/57.09
% 56.90/57.09 Resetting weight limit to 7.
% 56.90/57.09
% 56.90/57.09
% 56.90/57.09 Resetting weight limit to 7.
% 56.90/57.09
% 56.90/57.09 sos_size=4742
% 56.90/57.09
% 56.90/57.09 -- HEY sandbox, WE HAVE A PROOF!! --
% 56.90/57.09
% 56.90/57.09 ----> UNIT CONFLICT at 54.76 sec ----> 6245 [binary,6244.1,72.1] $F.
% 56.90/57.09
% 56.90/57.09 Length of proof is 19. Level of proof is 8.
% 56.90/57.09
% 56.90/57.09 ---------------- PROOF ----------------
% 56.90/57.09 % SZS status Theorem
% 56.90/57.09 % SZS output start Refutation
% See solution above
% 56.90/57.09 ------------ end of proof -------------
% 56.90/57.09
% 56.90/57.09
% 56.90/57.09 Search stopped by max_proofs option.
% 56.90/57.09
% 56.90/57.09
% 56.90/57.09 Search stopped by max_proofs option.
% 56.90/57.09
% 56.90/57.09 ============ end of search ============
% 56.90/57.09
% 56.90/57.09 -------------- statistics -------------
% 56.90/57.09 clauses given 1225
% 56.90/57.09 clauses generated 1523043
% 56.90/57.09 clauses kept 6225
% 56.90/57.09 clauses forward subsumed 8713
% 56.90/57.09 clauses back subsumed 544
% 56.90/57.09 Kbytes malloced 5859
% 56.90/57.09
% 56.90/57.09 ----------- times (seconds) -----------
% 56.90/57.09 user CPU time 54.76 (0 hr, 0 min, 54 sec)
% 56.90/57.09 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 56.90/57.09 wall-clock time 57 (0 hr, 0 min, 57 sec)
% 56.90/57.09
% 56.90/57.09 That finishes the proof of the theorem.
% 56.90/57.09
% 56.90/57.09 Process 18137 finished Wed Jul 27 04:32:12 2022
% 56.90/57.09 Otter interrupted
% 56.90/57.09 PROOF FOUND
%------------------------------------------------------------------------------