TSTP Solution File: SWC081-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWC081-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 : Tue Jul 19 21:45:12 EDT 2022
% Result : Unsatisfiable 90.13s 90.40s
% Output : Refutation 90.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC081-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 02:42:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.76/1.02 ============================== Prover9 ===============================
% 0.76/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.02 Process 22097 was started by sandbox2 on n021.cluster.edu,
% 0.76/1.02 Sun Jun 12 02:42:41 2022
% 0.76/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21944_n021.cluster.edu".
% 0.76/1.02 ============================== end of head ===========================
% 0.76/1.02
% 0.76/1.02 ============================== INPUT =================================
% 0.76/1.02
% 0.76/1.02 % Reading from file /tmp/Prover9_21944_n021.cluster.edu
% 0.76/1.02
% 0.76/1.02 set(prolog_style_variables).
% 0.76/1.02 set(auto2).
% 0.76/1.02 % set(auto2) -> set(auto).
% 0.76/1.02 % set(auto) -> set(auto_inference).
% 0.76/1.02 % set(auto) -> set(auto_setup).
% 0.76/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.02 % set(auto) -> set(auto_limits).
% 0.76/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.02 % set(auto) -> set(auto_denials).
% 0.76/1.02 % set(auto) -> set(auto_process).
% 0.76/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.02 % set(auto2) -> assign(stats, some).
% 0.76/1.02 % set(auto2) -> clear(echo_input).
% 0.76/1.02 % set(auto2) -> set(quiet).
% 0.76/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.02 % set(auto2) -> clear(print_given).
% 0.76/1.02 assign(lrs_ticks,-1).
% 0.76/1.02 assign(sos_limit,10000).
% 0.76/1.02 assign(order,kbo).
% 0.76/1.02 set(lex_order_vars).
% 0.76/1.02 clear(print_given).
% 0.76/1.02
% 0.76/1.02 % formulas(sos). % not echoed (201 formulas)
% 0.76/1.02
% 0.76/1.02 ============================== end of input ==========================
% 0.76/1.02
% 0.76/1.02 % From the command line: assign(max_seconds, 300).
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.02
% 0.76/1.02 % Formulas that are not ordinary clauses:
% 0.76/1.02
% 0.76/1.02 ============================== end of process non-clausal formulas ===
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.02
% 0.76/1.02 ============================== PREDICATE ELIMINATION =================
% 0.76/1.02 1 app(A,cons(B,cons(C,D))) != E | -ssList(D) | -ssList(A) | -ssItem(C) | -ssItem(B) | -equalelemsP(E) | -ssList(E) | B = C # label(clause180) # label(axiom). [assumption].
% 0.76/1.02 2 equalelemsP(nil) # label(clause1) # label(axiom). [assumption].
% 0.76/1.02 3 -ssItem(A) | equalelemsP(cons(A,nil)) # label(clause64) # label(axiom). [assumption].
% 0.76/1.02 4 skaf79(A) != skaf78(A) | -ssList(A) | equalelemsP(A) # label(clause89) # label(axiom). [assumption].
% 0.76/1.02 5 -ssList(A) | equalelemsP(A) | app(skaf80(A),cons(skaf78(A),cons(skaf79(A),skaf81(A)))) = A # label(clause142) # label(axiom). [assumption].
% 0.76/1.02 Derived: app(A,cons(B,cons(C,D))) != nil | -ssList(D) | -ssList(A) | -ssItem(C) | -ssItem(B) | -ssList(nil) | B = C. [resolve(1,f,2,a)].
% 0.76/1.02 Derived: app(A,cons(B,cons(C,D))) != cons(E,nil) | -ssList(D) | -ssList(A) | -ssItem(C) | -ssItem(B) | -ssList(cons(E,nil)) | B = C | -ssItem(E). [resolve(1,f,3,b)].
% 0.76/1.02 Derived: app(A,cons(B,cons(C,D))) != E | -ssList(D) | -ssList(A) | -ssItem(C) | -ssItem(B) | -ssList(E) | B = C | skaf79(E) != skaf78(E) | -ssList(E). [resolve(1,f,4,c)].
% 0.76/1.02 Derived: app(A,cons(B,cons(C,D))) != E | -ssList(D) | -ssList(A) | -ssItem(C) | -ssItem(B) | -ssList(E) | B = C | -ssList(E) | app(skaf80(E),cons(skaf78(E),cons(skaf79(E),skaf81(E)))) = E. [resolve(1,f,5,b)].
% 0.76/1.02 6 app(app(A,cons(B,C)),cons(B,D)) != E | -ssList(D) | -ssList(C) | -ssList(A) | -ssItem(B) | -duplicatefreeP(E) | -ssList(E) # label(clause179) # label(axiom). [assumption].
% 0.76/1.02 7 duplicatefreeP(nil) # label(clause2) # label(axiom). [assumption].
% 0.76/1.02 8 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(clause65) # label(axiom). [assumption].
% 0.76/1.02 9 -ssList(A) | duplicatefreeP(A) | ssItem(B) # label(clause72) # label(axiom). [assumption].
% 0.76/1.02 10 -ssList(A) | duplicatefreeP(A) | app(app(skaf75(A),cons(skaf74(A),skaf76(A))),cons(skaf74(A),skaf77(A))) = A # label(clause162) # label(axiom). [assumption].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(B,D)) != nil | -ssList(D) | -ssList(C) | -ssList(A) | -ssItem(B) | -ssList(nil). [resolve(6,f,7,a)].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(B,D)) != cons(E,nil) | -ssList(D) | -ssList(C) | -ssList(A) | -ssItem(B) | -ssList(cons(E,nil)) | -ssItem(E). [resolve(6,f,8,b)].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(B,D)) != E | -ssList(D) | -ssList(C) | -ssList(A) | -ssItem(B) | -ssList(E) | -ssList(E) | ssItem(F). [resolve(6,f,9,b)].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(B,D)) != E | -ssList(D) | -ssList(C) | -ssList(A) | -ssItem(B) | -ssList(E) | -ssList(E) | app(app(skaf75(E),cons(skaf74(E),skaf76(E))),cons(skaf74(E),skaf77(E))) = E. [resolve(6,f,10,b)].
% 0.76/1.03 11 app(app(A,cons(B,C)),cons(D,E)) != F | -ssList(E) | -ssList(C) | -ssList(A) | -ssItem(D) | -ssItem(B) | -strictorderP(F) | -ssList(F) | lt(B,D) | lt(D,B) # label(clause183) # label(axiom). [assumption].
% 0.76/1.03 12 strictorderP(nil) # label(clause5) # label(axiom). [assumption].
% 0.76/1.03 13 -ssItem(A) | strictorderP(cons(A,nil)) # label(clause68) # label(axiom). [assumption].
% 0.76/1.03 14 -lt(skaf60(A),skaf59(A)) | -ssList(A) | strictorderP(A) # label(clause92) # label(axiom). [assumption].
% 0.76/1.03 15 -lt(skaf59(A),skaf60(A)) | -ssList(A) | strictorderP(A) # label(clause93) # label(axiom). [assumption].
% 0.76/1.03 16 -ssList(A) | strictorderP(A) | app(app(skaf61(A),cons(skaf59(A),skaf62(A))),cons(skaf60(A),skaf63(A))) = A # label(clause165) # label(axiom). [assumption].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(D,E)) != nil | -ssList(E) | -ssList(C) | -ssList(A) | -ssItem(D) | -ssItem(B) | -ssList(nil) | lt(B,D) | lt(D,B). [resolve(11,g,12,a)].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(D,E)) != cons(F,nil) | -ssList(E) | -ssList(C) | -ssList(A) | -ssItem(D) | -ssItem(B) | -ssList(cons(F,nil)) | lt(B,D) | lt(D,B) | -ssItem(F). [resolve(11,g,13,b)].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(D,E)) != F | -ssList(E) | -ssList(C) | -ssList(A) | -ssItem(D) | -ssItem(B) | -ssList(F) | lt(B,D) | lt(D,B) | -lt(skaf60(F),skaf59(F)) | -ssList(F). [resolve(11,g,14,c)].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(D,E)) != F | -ssList(E) | -ssList(C) | -ssList(A) | -ssItem(D) | -ssItem(B) | -ssList(F) | lt(B,D) | lt(D,B) | -lt(skaf59(F),skaf60(F)) | -ssList(F). [resolve(11,g,15,c)].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(D,E)) != F | -ssList(E) | -ssList(C) | -ssList(A) | -ssItem(D) | -ssItem(B) | -ssList(F) | lt(B,D) | lt(D,B) | -ssList(F) | app(app(skaf61(F),cons(skaf59(F),skaf62(F))),cons(skaf60(F),skaf63(F))) = F. [resolve(11,g,16,b)].
% 0.76/1.03 17 app(app(A,cons(B,C)),cons(D,E)) != F | -ssList(E) | -ssList(C) | -ssList(A) | -ssItem(D) | -ssItem(B) | -totalorderP(F) | -ssList(F) | leq(B,D) | leq(D,B) # label(clause184) # label(axiom). [assumption].
% 0.76/1.03 18 totalorderP(nil) # label(clause6) # label(axiom). [assumption].
% 0.76/1.03 19 -ssItem(A) | totalorderP(cons(A,nil)) # label(clause69) # label(axiom). [assumption].
% 0.76/1.03 20 -leq(skaf55(A),skaf54(A)) | -ssList(A) | totalorderP(A) # label(clause94) # label(axiom). [assumption].
% 0.76/1.03 21 -leq(skaf54(A),skaf55(A)) | -ssList(A) | totalorderP(A) # label(clause95) # label(axiom). [assumption].
% 0.76/1.03 22 -ssList(A) | totalorderP(A) | app(app(skaf56(A),cons(skaf54(A),skaf57(A))),cons(skaf55(A),skaf58(A))) = A # label(clause166) # label(axiom). [assumption].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(D,E)) != nil | -ssList(E) | -ssList(C) | -ssList(A) | -ssItem(D) | -ssItem(B) | -ssList(nil) | leq(B,D) | leq(D,B). [resolve(17,g,18,a)].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(D,E)) != cons(F,nil) | -ssList(E) | -ssList(C) | -ssList(A) | -ssItem(D) | -ssItem(B) | -ssList(cons(F,nil)) | leq(B,D) | leq(D,B) | -ssItem(F). [resolve(17,g,19,b)].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(D,E)) != F | -ssList(E) | -ssList(C) | -ssList(A) | -ssItem(D) | -ssItem(B) | -ssList(F) | leq(B,D) | leq(D,B) | -leq(skaf55(F),skaf54(F)) | -ssList(F). [resolve(17,g,20,c)].
% 0.76/1.03 Derived: app(app(A,cons(B,C)),cons(D,E)) != F | -ssList(E) | -ssList(C) | -ssList(A) | -ssItem(D) | -ssItem(B) | -ssList(F) | leq(B,D) | leq(D,B) | -leq(skaf54(F),skaf55(F)) | -ssList(F). [resolve(17,g,21,c)].
% 2.39/2.70 Derived: app(app(A,cons(B,C)),cons(D,E)) != F | -ssList(E) | -ssList(C) | -ssList(A) | -ssItem(D) | -ssItem(B) | -ssList(F) | leq(B,D) | leq(D,B) | -ssList(F) | app(app(skaf56(F),cons(skaf54(F),skaf57(F))),cons(skaf55(F),skaf58(F))) = F. [resolve(17,g,22,b)].
% 2.39/2.70 23 -leq(A,B) | -leq(B,A) | app(app(C,cons(A,D)),cons(B,E)) != F | -ssList(E) | -ssList(D) | -ssList(C) | -ssItem(B) | -ssItem(A) | -cyclefreeP(F) | -ssList(F) # label(clause185) # label(axiom). [assumption].
% 2.39/2.70 24 cyclefreeP(nil) # label(clause7) # label(axiom). [assumption].
% 2.39/2.70 25 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(clause70) # label(axiom). [assumption].
% 2.39/2.70 26 -ssList(A) | cyclefreeP(A) | leq(skaf50(A),skaf49(A)) # label(clause87) # label(axiom). [assumption].
% 2.39/2.70 27 -ssList(A) | cyclefreeP(A) | leq(skaf49(A),skaf50(A)) # label(clause88) # label(axiom). [assumption].
% 2.39/2.70 28 -ssList(A) | cyclefreeP(A) | app(app(skaf51(A),cons(skaf49(A),skaf52(A))),cons(skaf50(A),skaf53(A))) = A # label(clause167) # label(axiom). [assumption].
% 2.39/2.70 Derived: -leq(A,B) | -leq(B,A) | app(app(C,cons(A,D)),cons(B,E)) != nil | -ssList(E) | -ssList(D) | -ssList(C) | -ssItem(B) | -ssItem(A) | -ssList(nil). [resolve(23,i,24,a)].
% 2.39/2.70 Derived: -leq(A,B) | -leq(B,A) | app(app(C,cons(A,D)),cons(B,E)) != cons(F,nil) | -ssList(E) | -ssList(D) | -ssList(C) | -ssItem(B) | -ssItem(A) | -ssList(cons(F,nil)) | -ssItem(F). [resolve(23,i,25,b)].
% 2.39/2.70 Derived: -leq(A,B) | -leq(B,A) | app(app(C,cons(A,D)),cons(B,E)) != F | -ssList(E) | -ssList(D) | -ssList(C) | -ssItem(B) | -ssItem(A) | -ssList(F) | -ssList(F) | leq(skaf50(F),skaf49(F)). [resolve(23,i,26,b)].
% 2.39/2.70 Derived: -leq(A,B) | -leq(B,A) | app(app(C,cons(A,D)),cons(B,E)) != F | -ssList(E) | -ssList(D) | -ssList(C) | -ssItem(B) | -ssItem(A) | -ssList(F) | -ssList(F) | leq(skaf49(F),skaf50(F)). [resolve(23,i,27,b)].
% 2.39/2.70 Derived: -leq(A,B) | -leq(B,A) | app(app(C,cons(A,D)),cons(B,E)) != F | -ssList(E) | -ssList(D) | -ssList(C) | -ssItem(B) | -ssItem(A) | -ssList(F) | -ssList(F) | app(app(skaf51(F),cons(skaf49(F),skaf52(F))),cons(skaf50(F),skaf53(F))) = F. [resolve(23,i,28,b)].
% 2.39/2.70
% 2.39/2.70 ============================== end predicate elimination =============
% 2.39/2.70
% 2.39/2.70 Auto_denials: (non-Horn, no changes).
% 2.39/2.70
% 2.39/2.70 Term ordering decisions:
% 2.39/2.70 Function symbol KB weights: nil=1. sk3=1. sk4=1. sk5=1. sk2=1. sk1=1. skac2=1. skac3=1. cons=1. app=1. skaf42=1. skaf43=1. skaf45=1. skaf46=1. skaf47=1. skaf48=1. hd=1. tl=1. skaf49=1. skaf50=1. skaf54=1. skaf55=1. skaf59=1. skaf60=1. skaf64=1. skaf65=1. skaf69=1. skaf70=1. skaf74=1. skaf78=1. skaf79=1. skaf44=1. skaf51=1. skaf52=1. skaf53=1. skaf56=1. skaf57=1. skaf58=1. skaf61=1. skaf62=1. skaf63=1. skaf66=1. skaf67=1. skaf68=1. skaf71=1. skaf72=1. skaf73=1. skaf75=1. skaf76=1. skaf77=1. skaf80=1. skaf81=1. skaf82=1. skaf83=1.
% 2.39/2.70
% 2.39/2.70 ============================== end of process initial clauses ========
% 2.39/2.70
% 2.39/2.70 ============================== CLAUSES FOR SEARCH ====================
% 2.39/2.70
% 2.39/2.70 ============================== end of clauses for search =============
% 2.39/2.70
% 2.39/2.70 ============================== SEARCH ================================
% 2.39/2.70
% 2.39/2.70 % Starting search at 0.18 seconds.
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=24.000, iters=3412
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=22.000, iters=3395
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=21.000, iters=3829
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=20.000, iters=3792
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=18.000, iters=3620
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=17.000, iters=3379
% 2.39/2.70
% 2.39/2.70 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 236 (0.00 of 0.82 sec).
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=16.000, iters=3841
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=15.000, iters=3449
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=14.000, iters=3344
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=13.000, iters=3344
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=12.000, iters=3342
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=11.000, iters=3335
% 2.39/2.70
% 2.39/2.70 Low Water (keep): wt=10.000, iters=3337
% 2.39/2.70
% 2.39/2.70 Low Water (displace): id=2578, wt=32.000
% 2.39/2.70
% 2.39/2.70 Low Water (displace): id=3688, wt=29.000
% 2.39/2.70
% 2.39/2.70 Low Water (displace): id=3775, wt=28.000
% 2.39/2.70
% 2.39/2.70 Low Water (displace): id=3778, wt=26.000
% 2.39/2.70
% 2.39/2.70 Low Water (displace): id=3222, wt=25.000
% 2.39/2.70
% 2.39/2.70 Low Water (displace): id=3776, wt=24.000
% 2.39/2.70
% 2.39/2.70 Low Water (displace): id=4388, wt=23.000
% 2.39/2.70
% 2.39/2.70 Low Water (displace): id=3760, wt=22.000
% 2.39/2.70
% 2.39/2.70 Low Water (displace): id=4480, wt=21.000
% 90.13/90.40
% 90.13/90.40 Low Water (keep): wt=9.000, iters=3337
% 90.13/90.40
% 90.13/90.40 Low Water (displace): id=3420, wt=20.000
% 90.13/90.40
% 90.13/90.40 Low Water (displace): id=4597, wt=19.000
% 90.13/90.40
% 90.13/90.40 Low Water (displace): id=4694, wt=18.000
% 90.13/90.40
% 90.13/90.40 Low Water (displace): id=14645, wt=8.000
% 90.13/90.40
% 90.13/90.40 Low Water (displace): id=15461, wt=7.000
% 90.13/90.40
% 90.13/90.40 Low Water (keep): wt=8.000, iters=3385
% 90.13/90.40
% 90.13/90.40 Low Water (keep): wt=7.000, iters=3352
% 90.13/90.40
% 90.13/90.40 Low Water (displace): id=46563, wt=6.000
% 90.13/90.40
% 90.13/90.40 ============================== PROOF =================================
% 90.13/90.40 % SZS status Unsatisfiable
% 90.13/90.40 % SZS output start Refutation
% 90.13/90.40
% 90.13/90.40 % Proof 1 at 84.52 (+ 4.89) seconds.
% 90.13/90.40 % Length of proof is 40.
% 90.13/90.40 % Level of proof is 9.
% 90.13/90.40 % Maximum clause weight is 18.000.
% 90.13/90.40 % Given clauses 21020.
% 90.13/90.40
% 90.13/90.40 31 ssList(nil) # label(clause8) # label(axiom). [assumption].
% 90.13/90.40 74 ssList(skaf45(A,B)) # label(clause51) # label(axiom). [assumption].
% 90.13/90.40 80 -ssList(A) | segmentP(A,A) # label(clause57) # label(axiom). [assumption].
% 90.13/90.40 91 -ssList(A) | app(nil,A) = A # label(clause74) # label(axiom). [assumption].
% 90.13/90.40 123 A != B | -neq(A,B) | -ssList(B) | -ssList(A) # label(clause115) # label(axiom). [assumption].
% 90.13/90.40 139 -frontsegP(A,B) | -ssList(B) | -ssList(A) | app(B,skaf45(A,B)) = A # label(clause132) # label(axiom). [assumption].
% 90.13/90.40 175 -segmentP(A,B) | -ssList(C) | -ssList(D) | -ssList(B) | -ssList(A) | segmentP(app(app(D,A),C),B) # label(clause172) # label(axiom). [assumption].
% 90.13/90.40 186 ssList(sk3) # label(co1_3) # label(negated_conjecture). [assumption].
% 90.13/90.40 187 ssList(sk4) # label(co1_4) # label(negated_conjecture). [assumption].
% 90.13/90.40 188 sk2 = sk4 # label(co1_5) # label(negated_conjecture). [assumption].
% 90.13/90.40 189 sk1 = sk3 # label(co1_6) # label(negated_conjecture). [assumption].
% 90.13/90.40 190 neq(sk2,nil) # label(co1_7) # label(negated_conjecture). [assumption].
% 90.13/90.40 191 neq(sk4,nil). [copy(190),rewrite([188(1)])].
% 90.13/90.40 192 -ssList(A) | -neq(A,nil) | -segmentP(sk2,A) | -segmentP(sk1,A) # label(co1_8) # label(negated_conjecture). [assumption].
% 90.13/90.40 193 -ssList(A) | -neq(A,nil) | -segmentP(sk4,A) | -segmentP(sk3,A). [copy(192),rewrite([188(4),189(6)])].
% 90.13/90.40 194 ssList(sk5) | nil = sk4 # label(co1_9) # label(negated_conjecture). [assumption].
% 90.13/90.40 195 ssList(sk5) | sk4 = nil. [copy(194),flip(b)].
% 90.13/90.40 198 neq(sk5,nil) | nil = sk4 # label(co1_11) # label(negated_conjecture). [assumption].
% 90.13/90.40 199 neq(sk5,nil) | sk4 = nil. [copy(198),flip(b)].
% 90.13/90.40 200 frontsegP(sk4,sk5) | nil = sk4 # label(co1_12) # label(negated_conjecture). [assumption].
% 90.13/90.40 201 frontsegP(sk4,sk5) | sk4 = nil. [copy(200),flip(b)].
% 90.13/90.40 202 frontsegP(sk3,sk5) | nil = sk4 # label(co1_13) # label(negated_conjecture). [assumption].
% 90.13/90.40 203 frontsegP(sk3,sk5) | sk4 = nil. [copy(202),flip(b)].
% 90.13/90.40 292 -segmentP(A,A) | -ssList(B) | -ssList(C) | -ssList(A) | segmentP(app(app(C,A),B),A). [factor(175,d,e)].
% 90.13/90.40 3374 sk4 != nil. [resolve(191,a,123,b),unit_del(b,31),unit_del(c,187)].
% 90.13/90.40 3384 frontsegP(sk3,sk5). [back_unit_del(203),unit_del(b,3374)].
% 90.13/90.40 3385 frontsegP(sk4,sk5). [back_unit_del(201),unit_del(b,3374)].
% 90.13/90.40 3386 neq(sk5,nil). [back_unit_del(199),unit_del(b,3374)].
% 90.13/90.40 3387 ssList(sk5). [back_unit_del(195),unit_del(b,3374)].
% 90.13/90.40 5607 app(nil,sk5) = sk5. [resolve(3387,a,91,a)].
% 90.13/90.40 5613 segmentP(sk5,sk5). [resolve(3387,a,80,a)].
% 90.13/90.40 5862 app(sk5,skaf45(sk3,sk5)) = sk3. [resolve(3384,a,139,a),unit_del(a,3387),unit_del(b,186)].
% 90.13/90.40 5871 app(sk5,skaf45(sk4,sk5)) = sk4. [resolve(3385,a,139,a),unit_del(a,3387),unit_del(b,187)].
% 90.13/90.40 5873 -segmentP(sk4,sk5) | -segmentP(sk3,sk5). [resolve(3386,a,193,b),unit_del(a,3387)].
% 90.13/90.40 5911 -ssList(A) | -ssList(B) | segmentP(app(app(B,sk5),A),sk5). [resolve(5613,a,292,a),unit_del(c,3387)].
% 90.13/90.40 164226 -ssList(A) | segmentP(app(sk5,A),sk5). [resolve(5911,b,31,a),rewrite([5607(4)])].
% 90.13/90.40 164250 segmentP(app(sk5,skaf45(A,B)),sk5). [resolve(164226,a,74,a)].
% 90.13/90.40 164281 segmentP(sk3,sk5). [para(5862(a,1),164250(a,1))].
% 90.13/90.40 164282 segmentP(sk4,sk5). [para(5871(a,1),164250(a,1))].
% 90.13/90.40 164283 $F. [back_unit_del(5873),unit_del(a,164282),unit_del(b,164281)].
% 90.13/90.40
% 90.13/90.40 % SZS output end Refutation
% 90.13/90.40 ============================== end of proof ==========================
% 90.13/90.40
% 90.13/90.40 ============================== STATISTICS ============================
% 90.13/90.40
% 90.13/90.40 Given=21020. Generated=9279027. Kept=164225. proofs=1.
% 90.13/90.40 Usable=20936. Sos=9432. Demods=463. Limbo=2, Disabled=134079. Hints=0.
% 90.13/90.40 Megabytes=80.31.
% 90.13/90.40 User_CPU=84.52, System_CPU=4.89, Wall_clock=89.
% 90.13/90.40
% 90.13/90.40 ============================== end of statistics =====================
% 90.13/90.40
% 90.13/90.40 ============================== end of search =========================
% 90.13/90.40
% 90.13/90.40 THEOREM PROVED
% 90.13/90.40 % SZS status Unsatisfiable
% 90.13/90.40
% 90.13/90.40 Exiting with 1 proof.
% 90.13/90.40
% 90.13/90.40 Process 22097 exit (max_proofs) Sun Jun 12 02:44:10 2022
% 90.13/90.40 Prover9 interrupted
%------------------------------------------------------------------------------