TSTP Solution File: CSR019+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR019+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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 : 600s
% DateTime : Fri Jul 15 23:03:36 EDT 2022
% Result : Theorem 1.06s 1.32s
% Output : Refutation 1.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : CSR019+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 11 00:35:50 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.46/1.05 ============================== Prover9 ===============================
% 0.46/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.05 Process 8311 was started by sandbox2 on n017.cluster.edu,
% 0.46/1.05 Sat Jun 11 00:35:51 2022
% 0.46/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_8157_n017.cluster.edu".
% 0.46/1.05 ============================== end of head ===========================
% 0.46/1.05
% 0.46/1.05 ============================== INPUT =================================
% 0.46/1.05
% 0.46/1.05 % Reading from file /tmp/Prover9_8157_n017.cluster.edu
% 0.46/1.05
% 0.46/1.05 set(prolog_style_variables).
% 0.46/1.05 set(auto2).
% 0.46/1.05 % set(auto2) -> set(auto).
% 0.46/1.05 % set(auto) -> set(auto_inference).
% 0.46/1.05 % set(auto) -> set(auto_setup).
% 0.46/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.05 % set(auto) -> set(auto_limits).
% 0.46/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.05 % set(auto) -> set(auto_denials).
% 0.46/1.05 % set(auto) -> set(auto_process).
% 0.46/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.05 % set(auto2) -> assign(stats, some).
% 0.46/1.05 % set(auto2) -> clear(echo_input).
% 0.46/1.05 % set(auto2) -> set(quiet).
% 0.46/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.05 % set(auto2) -> clear(print_given).
% 0.46/1.05 assign(lrs_ticks,-1).
% 0.46/1.05 assign(sos_limit,10000).
% 0.46/1.05 assign(order,kbo).
% 0.46/1.05 set(lex_order_vars).
% 0.46/1.05 clear(print_given).
% 0.46/1.05
% 0.46/1.05 % formulas(sos). % not echoed (48 formulas)
% 0.46/1.05
% 0.46/1.05 ============================== end of input ==========================
% 0.46/1.05
% 0.46/1.05 % From the command line: assign(max_seconds, 300).
% 0.46/1.05
% 0.46/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.05
% 0.46/1.05 % Formulas that are not ordinary clauses:
% 0.46/1.05 1 (all Time1 all Fluent all Time2 (stoppedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (happens(Event,Time) & less(Time1,Time) & less(Time,Time2) & terminates(Event,Fluent,Time))))) # label(stoppedin_defn) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 2 (all Time1 all Time2 all Fluent (startedIn(Time1,Fluent,Time2) <-> (exists Event exists Time (happens(Event,Time) & less(Time1,Time) & less(Time,Time2) & initiates(Event,Fluent,Time))))) # label(startedin_defn) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 3 (all Event all Time all Fluent all Fluent2 all 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)))) # label(change_holding) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 4 (all Event all Time1 all Fluent1 all Time2 all 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)))) # label(antitrajectory) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 5 (all Fluent all Time (holdsAt(Fluent,Time) & -releasedAt(Fluent,plus(Time,n1)) & -(exists Event (happens(Event,Time) & terminates(Event,Fluent,Time))) -> holdsAt(Fluent,plus(Time,n1)))) # label(keep_holding) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 6 (all Fluent all Time (-holdsAt(Fluent,Time) & -releasedAt(Fluent,plus(Time,n1)) & -(exists Event (happens(Event,Time) & initiates(Event,Fluent,Time))) -> -holdsAt(Fluent,plus(Time,n1)))) # label(keep_not_holding) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 7 (all Fluent all Time (releasedAt(Fluent,Time) & -(exists Event (happens(Event,Time) & (initiates(Event,Fluent,Time) | terminates(Event,Fluent,Time)))) -> releasedAt(Fluent,plus(Time,n1)))) # label(keep_released) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 8 (all Fluent all Time (-releasedAt(Fluent,Time) & -(exists Event (happens(Event,Time) & releases(Event,Fluent,Time))) -> -releasedAt(Fluent,plus(Time,n1)))) # label(keep_not_released) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 9 (all Event all Time all Fluent (happens(Event,Time) & initiates(Event,Fluent,Time) -> holdsAt(Fluent,plus(Time,n1)))) # label(happens_holds) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 10 (all Event all Time all Fluent (happens(Event,Time) & terminates(Event,Fluent,Time) -> -holdsAt(Fluent,plus(Time,n1)))) # label(happens_terminates_not_holds) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 11 (all Event all Time all Fluent (happens(Event,Time) & releases(Event,Fluent,Time) -> releasedAt(Fluent,plus(Time,n1)))) # label(happens_releases) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 12 (all Event all Time all Fluent (happens(Event,Time) & (initiates(Event,Fluent,Time) | terminates(Event,Fluent,Time)) -> -releasedAt(Fluent,plus(Time,n1)))) # label(happens_not_released) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 13 (all Event all Fluent all 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))) # label(initiates_all_defn) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 14 (all Event all Fluent all 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))) # label(terminates_all_defn) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 15 (all Event all Fluent all Time -releases(Event,Fluent,Time)) # label(releases_all_defn) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 16 (all Event all Time (happens(Event,Time) <-> Event = push & Time = n0 | Event = pull & Time = n1 | Event = pull & Time = n2 | Event = push & Time = n2)) # label(happens_all_defn) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 17 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 18 (all X all Y (less_or_equal(X,Y) <-> less(X,Y) | X = Y)) # label(less_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 19 -(exists X less(X,n0)) # label(less0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 20 (all X (less(X,n1) <-> less_or_equal(X,n0))) # label(less1) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 21 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 22 (all X (less(X,n3) <-> less_or_equal(X,n2))) # label(less3) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 23 (all X (less(X,n4) <-> less_or_equal(X,n3))) # label(less4) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 24 (all X (less(X,n5) <-> less_or_equal(X,n4))) # label(less5) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 25 (all X (less(X,n6) <-> less_or_equal(X,n5))) # label(less6) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 26 (all X (less(X,n7) <-> less_or_equal(X,n6))) # label(less7) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 27 (all X (less(X,n8) <-> less_or_equal(X,n7))) # label(less8) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 28 (all X (less(X,n9) <-> less_or_equal(X,n8))) # label(less9) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 29 (all X all Y (less(X,Y) <-> -less(Y,X) & Y != X)) # label(less_property) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.05 30 (all Fluent all Time -releasedAt(Fluent,Time)) # label(not_releasedAt) # label(hypothesis) # label(non_clause). [assumption].
% 0.46/1.05 31 --holdsAt(forwards,n2) # label(not_forwards_2) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.05
% 0.46/1.05 ============================== end of process non-clausal formulas ===
% 0.46/1.06
% 0.46/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.06
% 0.46/1.06 ============================== PREDICATE ELIMINATION =================
% 0.46/1.06 32 stoppedIn(A,B,C) | -happens(D,E) | -less(A,E) | -less(E,C) | -terminates(D,B,E) # label(stoppedin_defn) # label(axiom). [clausify(1)].
% 0.46/1.06 33 -stoppedIn(A,B,C) | happens(f1(A,B,C),f2(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(1)].
% 0.46/1.06 34 -stoppedIn(A,B,C) | less(A,f2(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(1)].
% 0.46/1.06 35 -stoppedIn(A,B,C) | less(f2(A,B,C),C) # label(stoppedin_defn) # label(axiom). [clausify(1)].
% 0.46/1.06 36 -stoppedIn(A,B,C) | terminates(f1(A,B,C),B,f2(A,B,C)) # label(stoppedin_defn) # label(axiom). [clausify(1)].
% 0.46/1.06 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -terminates(A,E,B) | happens(f1(C,E,D),f2(C,E,D)). [resolve(32,a,33,a)].
% 0.46/1.06 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -terminates(A,E,B) | less(C,f2(C,E,D)). [resolve(32,a,34,a)].
% 0.46/1.06 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -terminates(A,E,B) | less(f2(C,E,D),D). [resolve(32,a,35,a)].
% 0.46/1.06 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -terminates(A,E,B) | terminates(f1(C,E,D),E,f2(C,E,D)). [resolve(32,a,36,a)].
% 0.46/1.06 37 -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)) # label(change_holding) # label(axiom). [clausify(3)].
% 0.46/1.06 Derived: -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | happens(f1(B,C,plus(B,D)),f2(B,C,plus(B,D))). [resolve(37,e,33,a)].
% 0.46/1.06 Derived: -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(B,f2(B,C,plus(B,D))). [resolve(37,e,34,a)].
% 0.46/1.06 Derived: -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(f2(B,C,plus(B,D)),plus(B,D)). [resolve(37,e,35,a)].
% 0.46/1.06 Derived: -happens(A,B) | -initiates(A,C,B) | -less(n0,D) | -trajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | terminates(f1(B,C,plus(B,D)),C,f2(B,C,plus(B,D))). [resolve(37,e,36,a)].
% 0.46/1.06 38 startedIn(A,B,C) | -happens(D,E) | -less(A,E) | -less(E,C) | -initiates(D,B,E) # label(startedin_defn) # label(axiom). [clausify(2)].
% 0.46/1.06 39 -startedIn(A,B,C) | happens(f3(A,C,B),f4(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(2)].
% 0.46/1.06 40 -startedIn(A,B,C) | less(A,f4(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(2)].
% 0.46/1.06 41 -startedIn(A,B,C) | less(f4(A,C,B),C) # label(startedin_defn) # label(axiom). [clausify(2)].
% 0.46/1.06 42 -startedIn(A,B,C) | initiates(f3(A,C,B),B,f4(A,C,B)) # label(startedin_defn) # label(axiom). [clausify(2)].
% 0.46/1.06 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -initiates(A,E,B) | happens(f3(C,D,E),f4(C,D,E)). [resolve(38,a,39,a)].
% 0.46/1.06 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -initiates(A,E,B) | less(C,f4(C,D,E)). [resolve(38,a,40,a)].
% 0.46/1.06 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -initiates(A,E,B) | less(f4(C,D,E),D). [resolve(38,a,41,a)].
% 0.46/1.06 Derived: -happens(A,B) | -less(C,B) | -less(B,D) | -initiates(A,E,B) | initiates(f3(C,D,E),E,f4(C,D,E)). [resolve(38,a,42,a)].
% 0.46/1.06 43 -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)) # label(antitrajectory) # label(axiom). [clausify(4)].
% 0.46/1.06 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | happens(f3(B,plus(B,D),C),f4(B,plus(B,D),C)). [resolve(43,e,39,a)].
% 0.46/1.06 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(B,f4(B,plus(B,D),C)). [resolve(43,e,40,a)].
% 0.46/1.06 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | less(f4(B,plus(B,D),C),plus(B,D)). [resolve(43,e,41,a)].
% 0.46/1.06 Derived: -happens(A,B) | -terminates(A,C,B) | -less(n0,D) | -antitrajectory(C,B,E,D) | holdsAt(E,plus(B,D)) | initiates(f3(B,plus(B,D),C),C,f4(B,plus(B,D),C)). [resolve(43,e,42,a)].
% 0.46/1.06 44 -happens(A,B) | -releases(A,C,B) | releasedAt(C,plus(B,n1)) # label(happens_releases) # label(axiom). [clausify(11)].
% 0.46/1.06 45 releasedAt(A,B) | releases(f8(A,B),A,B) | -releasedAt(A,plus(B,n1)) # label(keep_not_released) # label(axiom). [clausify(8)].
% 1.06/1.32 46 -releases(A,B,C) # label(releases_all_defn) # label(axiom). [clausify(15)].
% 1.06/1.32
% 1.06/1.32 ============================== end predicate elimination =============
% 1.06/1.32
% 1.06/1.32 Auto_denials: (non-Horn, no changes).
% 1.06/1.32
% 1.06/1.32 Term ordering decisions:
% 1.06/1.32 Function symbol KB weights: push=1. pull=1. n1=1. n2=1. backwards=1. forwards=1. spinning=1. n0=1. n3=1. n4=1. n5=1. n6=1. n7=1. n8=1. n9=1. plus=1. f5=1. f6=1. f7=1. f8=1. f1=1. f2=1. f3=1. f4=1.
% 1.06/1.32
% 1.06/1.32 ============================== end of process initial clauses ========
% 1.06/1.32
% 1.06/1.32 ============================== CLAUSES FOR SEARCH ====================
% 1.06/1.32
% 1.06/1.32 ============================== end of clauses for search =============
% 1.06/1.32
% 1.06/1.32 ============================== SEARCH ================================
% 1.06/1.32
% 1.06/1.32 % Starting search at 0.03 seconds.
% 1.06/1.32
% 1.06/1.32 ============================== PROOF =================================
% 1.06/1.32 % SZS status Theorem
% 1.06/1.32 % SZS output start Refutation
% 1.06/1.32
% 1.06/1.32 % Proof 1 at 0.27 (+ 0.01) seconds.
% 1.06/1.32 % Length of proof is 36.
% 1.06/1.32 % Level of proof is 6.
% 1.06/1.32 % Maximum clause weight is 13.000.
% 1.06/1.32 % Given clauses 490.
% 1.06/1.32
% 1.06/1.32 10 (all Event all Time all Fluent (happens(Event,Time) & terminates(Event,Fluent,Time) -> -holdsAt(Fluent,plus(Time,n1)))) # label(happens_terminates_not_holds) # label(axiom) # label(non_clause). [assumption].
% 1.06/1.32 14 (all Event all Fluent all 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))) # label(terminates_all_defn) # label(axiom) # label(non_clause). [assumption].
% 1.06/1.32 16 (all Event all Time (happens(Event,Time) <-> Event = push & Time = n0 | Event = pull & Time = n1 | Event = pull & Time = n2 | Event = push & Time = n2)) # label(happens_all_defn) # label(axiom) # label(non_clause). [assumption].
% 1.06/1.32 17 (all X all Y plus(X,Y) = plus(Y,X)) # label(symmetry_of_plus) # label(axiom) # label(non_clause). [assumption].
% 1.06/1.32 18 (all X all Y (less_or_equal(X,Y) <-> less(X,Y) | X = Y)) # label(less_or_equal) # label(axiom) # label(non_clause). [assumption].
% 1.06/1.32 20 (all X (less(X,n1) <-> less_or_equal(X,n0))) # label(less1) # label(axiom) # label(non_clause). [assumption].
% 1.06/1.32 21 (all X (less(X,n2) <-> less_or_equal(X,n1))) # label(less2) # label(axiom) # label(non_clause). [assumption].
% 1.06/1.32 29 (all X all Y (less(X,Y) <-> -less(Y,X) & Y != X)) # label(less_property) # label(axiom) # label(non_clause). [assumption].
% 1.06/1.32 31 --holdsAt(forwards,n2) # label(not_forwards_2) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.06/1.32 55 -happens(A,B) | -terminates(A,C,B) | -holdsAt(C,plus(B,n1)) # label(happens_terminates_not_holds) # label(axiom). [clausify(10)].
% 1.06/1.32 82 terminates(A,B,C) | pull != A | forwards != B | happens(push,C) # label(terminates_all_defn) # label(axiom). [clausify(14)].
% 1.06/1.32 89 -happens(A,B) | n0 = B | pull = A | n2 = B # label(happens_all_defn) # label(axiom). [clausify(16)].
% 1.06/1.32 92 happens(A,B) | pull != A | n1 != B # label(happens_all_defn) # label(axiom). [clausify(16)].
% 1.06/1.32 95 push != pull # label(push_not_pull) # label(axiom). [assumption].
% 1.06/1.32 96 pull != push. [copy(95),flip(a)].
% 1.06/1.32 102 plus(n0,n1) = n1 # label(plus0_1) # label(axiom). [assumption].
% 1.06/1.32 105 plus(n1,n1) = n2 # label(plus1_1) # label(axiom). [assumption].
% 1.06/1.32 111 plus(A,B) = plus(B,A) # label(symmetry_of_plus) # label(axiom). [clausify(17)].
% 1.06/1.32 114 less_or_equal(A,B) | B != A # label(less_or_equal) # label(axiom). [clausify(18)].
% 1.06/1.32 117 less(A,n1) | -less_or_equal(A,n0) # label(less1) # label(axiom). [clausify(20)].
% 1.06/1.32 119 less(A,n2) | -less_or_equal(A,n1) # label(less2) # label(axiom). [clausify(21)].
% 1.06/1.32 135 -less(A,B) | B != A # label(less_property) # label(axiom). [clausify(29)].
% 1.06/1.32 141 holdsAt(forwards,n2) # label(not_forwards_2) # label(negated_conjecture). [clausify(31)].
% 1.06/1.32 151 plus(n1,n0) = n1. [back_rewrite(102),rewrite([111(3)])].
% 1.06/1.32 163 terminates(pull,A,B) | forwards != A | happens(push,B). [xx_res(82,b)].
% 1.06/1.32 171 happens(pull,A) | n1 != A. [xx_res(92,b)].
% 1.06/1.32 184 less_or_equal(A,A). [xx_res(114,b)].
% 1.06/1.32 210 less(n1,n2). [resolve(184,a,119,b)].
% 1.06/1.32 211 less(n0,n1). [resolve(184,a,117,b)].
% 1.06/1.32 234 n2 != n1. [resolve(210,a,135,a)].
% 1.06/1.32 237 n0 != n1. [resolve(211,a,135,a),flip(a)].
% 1.06/1.32 263 terminates(pull,forwards,A) | happens(push,A). [xx_res(163,b)].
% 1.06/1.32 328 happens(pull,n1). [resolve(171,b,151,a(flip)),rewrite([151(4)])].
% 1.06/1.32 415 happens(push,A) | -happens(pull,A) | -holdsAt(forwards,plus(A,n1)). [resolve(263,a,55,b)].
% 1.06/1.32 3525 happens(push,n1). [para(105(a,1),415(c,2)),unit_del(b,328),unit_del(c,141)].
% 1.06/1.32 3526 $F. [resolve(3525,a,89,a),unit_del(a,237),unit_del(b,96),unit_del(c,234)].
% 1.06/1.32
% 1.06/1.32 % SZS output end Refutation
% 1.06/1.32 ============================== end of proof ==========================
% 1.06/1.32
% 1.06/1.32 ============================== STATISTICS ============================
% 1.06/1.32
% 1.06/1.32 Given=490. Generated=6855. Kept=3477. proofs=1.
% 1.06/1.32 Usable=477. Sos=2829. Demods=13. Limbo=0, Disabled=295. Hints=0.
% 1.06/1.32 Megabytes=3.86.
% 1.06/1.32 User_CPU=0.27, System_CPU=0.01, Wall_clock=0.
% 1.06/1.32
% 1.06/1.32 ============================== end of statistics =====================
% 1.06/1.32
% 1.06/1.32 ============================== end of search =========================
% 1.06/1.32
% 1.06/1.32 THEOREM PROVED
% 1.06/1.32 % SZS status Theorem
% 1.06/1.32
% 1.06/1.32 Exiting with 1 proof.
% 1.06/1.32
% 1.06/1.32 Process 8311 exit (max_proofs) Sat Jun 11 00:35:51 2022
% 1.06/1.32 Prover9 interrupted
%------------------------------------------------------------------------------