TSTP Solution File: SWC206-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWC206-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:59 EDT 2022
% Result : Unsatisfiable 7.46s 7.80s
% Output : Refutation 7.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC206-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.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 : 600
% 0.12/0.33 % DateTime : Sun Jun 12 18:29:01 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.03 ============================== Prover9 ===============================
% 0.71/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.71/1.03 Process 30752 was started by sandbox2 on n027.cluster.edu,
% 0.71/1.03 Sun Jun 12 18:29:02 2022
% 0.71/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_30599_n027.cluster.edu".
% 0.71/1.03 ============================== end of head ===========================
% 0.71/1.03
% 0.71/1.03 ============================== INPUT =================================
% 0.71/1.03
% 0.71/1.03 % Reading from file /tmp/Prover9_30599_n027.cluster.edu
% 0.71/1.03
% 0.71/1.03 set(prolog_style_variables).
% 0.71/1.03 set(auto2).
% 0.71/1.03 % set(auto2) -> set(auto).
% 0.71/1.03 % set(auto) -> set(auto_inference).
% 0.71/1.03 % set(auto) -> set(auto_setup).
% 0.71/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.71/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/1.03 % set(auto) -> set(auto_limits).
% 0.71/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/1.03 % set(auto) -> set(auto_denials).
% 0.71/1.03 % set(auto) -> set(auto_process).
% 0.71/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.71/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.71/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.71/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.71/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.71/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.71/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.71/1.03 % set(auto2) -> assign(stats, some).
% 0.71/1.03 % set(auto2) -> clear(echo_input).
% 0.71/1.03 % set(auto2) -> set(quiet).
% 0.71/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.71/1.03 % set(auto2) -> clear(print_given).
% 0.71/1.03 assign(lrs_ticks,-1).
% 0.71/1.03 assign(sos_limit,10000).
% 0.71/1.03 assign(order,kbo).
% 0.71/1.03 set(lex_order_vars).
% 0.71/1.03 clear(print_given).
% 0.71/1.03
% 0.71/1.03 % formulas(sos). % not echoed (198 formulas)
% 0.71/1.03
% 0.71/1.03 ============================== end of input ==========================
% 0.71/1.03
% 0.71/1.03 % From the command line: assign(max_seconds, 300).
% 0.71/1.03
% 0.71/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/1.03
% 0.71/1.03 % Formulas that are not ordinary clauses:
% 0.71/1.03
% 0.71/1.03 ============================== end of process non-clausal formulas ===
% 0.71/1.03
% 0.71/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/1.03
% 0.71/1.03 ============================== PREDICATE ELIMINATION =================
% 0.71/1.03 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.71/1.03 2 equalelemsP(nil) # label(clause1) # label(axiom). [assumption].
% 0.71/1.03 3 -ssItem(A) | equalelemsP(cons(A,nil)) # label(clause64) # label(axiom). [assumption].
% 0.71/1.03 4 skaf79(A) != skaf78(A) | -ssList(A) | equalelemsP(A) # label(clause89) # label(axiom). [assumption].
% 0.71/1.03 5 -ssList(A) | equalelemsP(A) | app(skaf80(A),cons(skaf78(A),cons(skaf79(A),skaf81(A)))) = A # label(clause142) # label(axiom). [assumption].
% 0.71/1.03 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.71/1.03 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.71/1.03 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.71/1.03 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.71/1.03 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.71/1.03 7 duplicatefreeP(nil) # label(clause2) # label(axiom). [assumption].
% 0.71/1.03 8 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(clause65) # label(axiom). [assumption].
% 0.71/1.03 9 -ssList(A) | duplicatefreeP(A) | ssItem(B) # label(clause72) # label(axiom). [assumption].
% 0.71/1.03 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.71/1.04 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.71/1.04 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.71/1.04 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.71/1.04 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.71/1.04 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.71/1.04 12 strictorderP(nil) # label(clause5) # label(axiom). [assumption].
% 0.71/1.04 13 -ssItem(A) | strictorderP(cons(A,nil)) # label(clause68) # label(axiom). [assumption].
% 0.71/1.04 14 -lt(skaf60(A),skaf59(A)) | -ssList(A) | strictorderP(A) # label(clause92) # label(axiom). [assumption].
% 0.71/1.04 15 -lt(skaf59(A),skaf60(A)) | -ssList(A) | strictorderP(A) # label(clause93) # label(axiom). [assumption].
% 0.71/1.04 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.71/1.04 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.71/1.04 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.71/1.04 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.71/1.04 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.71/1.04 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.71/1.04 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.71/1.04 18 totalorderP(nil) # label(clause6) # label(axiom). [assumption].
% 0.71/1.04 19 -ssItem(A) | totalorderP(cons(A,nil)) # label(clause69) # label(axiom). [assumption].
% 0.71/1.04 20 -leq(skaf55(A),skaf54(A)) | -ssList(A) | totalorderP(A) # label(clause94) # label(axiom). [assumption].
% 0.71/1.04 21 -leq(skaf54(A),skaf55(A)) | -ssList(A) | totalorderP(A) # label(clause95) # label(axiom). [assumption].
% 0.71/1.04 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.71/1.04 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.71/1.04 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.71/1.04 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.71/1.04 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.44/2.71 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.44/2.71 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.44/2.71 24 cyclefreeP(nil) # label(clause7) # label(axiom). [assumption].
% 2.44/2.71 25 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(clause70) # label(axiom). [assumption].
% 2.44/2.71 26 -ssList(A) | cyclefreeP(A) | leq(skaf50(A),skaf49(A)) # label(clause87) # label(axiom). [assumption].
% 2.44/2.71 27 -ssList(A) | cyclefreeP(A) | leq(skaf49(A),skaf50(A)) # label(clause88) # label(axiom). [assumption].
% 2.44/2.71 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.44/2.71 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.44/2.71 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.44/2.71 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.44/2.71 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.44/2.71 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.44/2.71
% 2.44/2.71 ============================== end predicate elimination =============
% 2.44/2.71
% 2.44/2.71 Auto_denials: (non-Horn, no changes).
% 2.44/2.71
% 2.44/2.71 Term ordering decisions:
% 2.44/2.71 Function symbol KB weights: nil=1. sk4=1. sk3=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.44/2.71
% 2.44/2.71 ============================== end of process initial clauses ========
% 2.44/2.71
% 2.44/2.71 ============================== CLAUSES FOR SEARCH ====================
% 2.44/2.71
% 2.44/2.71 ============================== end of clauses for search =============
% 2.44/2.71
% 2.44/2.71 ============================== SEARCH ================================
% 2.44/2.71
% 2.44/2.71 % Starting search at 0.20 seconds.
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=28.000, iters=3672
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=24.000, iters=3501
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=22.000, iters=3488
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=21.000, iters=3353
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=17.000, iters=3340
% 2.44/2.71
% 2.44/2.71 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 185 (0.00 of 0.82 sec).
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=16.000, iters=3844
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=15.000, iters=3453
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=14.000, iters=3355
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=13.000, iters=3334
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=12.000, iters=3339
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=11.000, iters=3341
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=10.000, iters=3343
% 2.44/2.71
% 2.44/2.71 Low Water (displace): id=2572, wt=32.000
% 2.44/2.71
% 2.44/2.71 Low Water (displace): id=3770, wt=29.000
% 2.44/2.71
% 2.44/2.71 Low Water (displace): id=3785, wt=28.000
% 2.44/2.71
% 2.44/2.71 Low Water (keep): wt=9.000, iters=3335
% 2.44/2.71
% 2.44/2.71 Low Water (displace): id=3788, wt=26.000
% 2.44/2.71
% 2.44/2.71 Low Water (displace): id=3216, wt=25.000
% 2.44/2.71
% 2.44/2.71 Low Water (displace): id=3786, wt=24.000
% 2.44/2.71
% 2.44/2.71 Low Water (displace): id=3225, wt=22.000
% 2.44/2.71
% 2.44/2.71 Low Water (displace): id=3227, wt=21.000
% 2.44/2.71
% 2.44/2.71 Low Water (displace): id=3502, wt=20.000
% 7.46/7.80
% 7.46/7.80 Low Water (displace): id=2231, wt=19.000
% 7.46/7.80
% 7.46/7.80 Low Water (displace): id=4452, wt=18.000
% 7.46/7.80
% 7.46/7.80 Low Water (displace): id=14187, wt=8.000
% 7.46/7.80
% 7.46/7.80 Low Water (displace): id=14407, wt=7.000
% 7.46/7.80
% 7.46/7.80 Low Water (keep): wt=8.000, iters=3362
% 7.46/7.80
% 7.46/7.80 Low Water (keep): wt=7.000, iters=3333
% 7.46/7.80
% 7.46/7.80 Low Water (displace): id=45987, wt=6.000
% 7.46/7.80
% 7.46/7.80 ============================== PROOF =================================
% 7.46/7.80 % SZS status Unsatisfiable
% 7.46/7.80 % SZS output start Refutation
% 7.46/7.80
% 7.46/7.80 % Proof 1 at 6.62 (+ 0.18) seconds.
% 7.46/7.80 % Length of proof is 34.
% 7.46/7.80 % Level of proof is 5.
% 7.46/7.80 % Maximum clause weight is 18.000.
% 7.46/7.80 % Given clauses 4088.
% 7.46/7.80
% 7.46/7.80 31 ssList(nil) # label(clause8) # label(axiom). [assumption].
% 7.46/7.80 79 -ssList(A) | segmentP(A,nil) # label(clause56) # label(axiom). [assumption].
% 7.46/7.80 90 -ssList(A) | app(A,nil) = A # label(clause73) # label(axiom). [assumption].
% 7.46/7.80 108 -ssList(A) | -ssList(B) | neq(B,A) | B = A # label(clause100) # label(axiom). [assumption].
% 7.46/7.80 123 A != B | -neq(A,B) | -ssList(B) | -ssList(A) # label(clause115) # label(axiom). [assumption].
% 7.46/7.80 134 -segmentP(A,B) | -segmentP(B,A) | -ssList(A) | -ssList(B) | B = A # label(clause127) # label(axiom). [assumption].
% 7.46/7.80 155 -ssList(A) | -ssList(B) | -ssList(C) | app(app(C,B),A) = app(C,app(B,A)) # label(clause149) # label(axiom). [assumption].
% 7.46/7.80 175 -segmentP(A,B) | -ssList(C) | -ssList(D) | -ssList(B) | -ssList(A) | segmentP(app(app(D,A),C),B) # label(clause172) # label(axiom). [assumption].
% 7.46/7.80 186 ssList(sk3) # label(co1_3) # label(negated_conjecture). [assumption].
% 7.46/7.80 188 sk2 = sk4 # label(co1_5) # label(negated_conjecture). [assumption].
% 7.46/7.80 189 sk1 = sk3 # label(co1_6) # label(negated_conjecture). [assumption].
% 7.46/7.80 190 neq(sk2,nil) # label(co1_7) # label(negated_conjecture). [assumption].
% 7.46/7.80 191 neq(sk4,nil). [copy(190),rewrite([188(1)])].
% 7.46/7.80 192 -neq(sk1,nil) # label(co1_8) # label(negated_conjecture). [assumption].
% 7.46/7.80 193 -neq(sk3,nil). [copy(192),rewrite([189(1)])].
% 7.46/7.80 196 ssList(sk5) | -neq(sk4,nil) # label(co1_10) # label(negated_conjecture). [assumption].
% 7.46/7.80 197 ssList(sk5). [copy(196),unit_del(b,191)].
% 7.46/7.80 198 neq(sk5,nil) | -neq(sk4,nil) # label(co1_11) # label(negated_conjecture). [assumption].
% 7.46/7.80 199 neq(sk5,nil). [copy(198),unit_del(b,191)].
% 7.46/7.80 202 segmentP(sk3,sk5) | -neq(sk4,nil) # label(co1_13) # label(negated_conjecture). [assumption].
% 7.46/7.80 203 segmentP(sk3,sk5). [copy(202),unit_del(b,191)].
% 7.46/7.80 269 -ssList(A) | -ssList(B) | app(app(B,A),A) = app(B,app(A,A)). [factor(155,a,b)].
% 7.46/7.80 281 -segmentP(A,B) | -ssList(C) | -ssList(B) | -ssList(A) | segmentP(app(app(C,A),C),B). [factor(175,b,c)].
% 7.46/7.80 442 -ssList(A) | app(app(A,A),A) = app(A,app(A,A)). [factor(269,a,b)].
% 7.46/7.80 444 -segmentP(A,B) | -ssList(A) | -ssList(B) | segmentP(app(app(A,A),A),B). [factor(281,b,d)].
% 7.46/7.80 1068 app(nil,nil) = nil. [resolve(90,a,31,a)].
% 7.46/7.80 1399 -ssList(A) | neq(A,nil) | nil = A. [resolve(108,a,31,a),flip(c)].
% 7.46/7.80 3426 segmentP(sk5,nil). [resolve(197,a,79,a)].
% 7.46/7.80 3449 sk5 != nil. [resolve(199,a,123,b),unit_del(b,31),unit_del(c,197)].
% 7.46/7.80 5102 app(app(sk3,sk3),sk3) = app(sk3,app(sk3,sk3)). [resolve(442,a,186,a)].
% 7.46/7.80 5105 segmentP(app(sk3,app(sk3,sk3)),sk5). [resolve(444,a,203,a),rewrite([5102(9)]),unit_del(a,186),unit_del(b,197)].
% 7.46/7.80 5569 -segmentP(nil,sk5). [resolve(3426,a,134,b),unit_del(b,31),unit_del(c,197),unit_del(d,3449)].
% 7.46/7.80 54606 sk3 = nil. [resolve(1399,a,186,a),flip(b),unit_del(a,193)].
% 7.46/7.80 54607 $F. [back_rewrite(5105),rewrite([54606(1),54606(2),54606(3),1068(4),1068(3)]),unit_del(a,5569)].
% 7.46/7.80
% 7.46/7.80 % SZS output end Refutation
% 7.46/7.80 ============================== end of proof ==========================
% 7.46/7.80
% 7.46/7.80 ============================== STATISTICS ============================
% 7.46/7.80
% 7.46/7.80 Given=4088. Generated=298717. Kept=54552. proofs=1.
% 7.46/7.80 Usable=3613. Sos=7961. Demods=384. Limbo=1, Disabled=43198. Hints=0.
% 7.46/7.80 Megabytes=34.87.
% 7.46/7.80 User_CPU=6.62, System_CPU=0.18, Wall_clock=7.
% 7.46/7.80
% 7.46/7.80 ============================== end of statistics =====================
% 7.46/7.80
% 7.46/7.80 ============================== end of search =========================
% 7.46/7.80
% 7.46/7.80 THEOREM PROVED
% 7.46/7.80 % SZS status Unsatisfiable
% 7.46/7.80
% 7.46/7.80 Exiting with 1 proof.
% 7.46/7.80
% 7.46/7.80 Process 30752 exit (max_proofs) Sun Jun 12 18:29:09 2022
% 7.46/7.80 Prover9 interrupted
%------------------------------------------------------------------------------