TSTP Solution File: SWC110-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWC110-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:24 EDT 2022
% Result : Unsatisfiable 108.58s 108.82s
% Output : Refutation 108.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC110-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 00:39:44 EDT 2022
% 0.20/0.34 % CPUTime :
% 0.44/1.05 ============================== Prover9 ===============================
% 0.44/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.05 Process 21401 was started by sandbox2 on n013.cluster.edu,
% 0.44/1.05 Mon Jun 13 00:39:44 2022
% 0.44/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21248_n013.cluster.edu".
% 0.44/1.05 ============================== end of head ===========================
% 0.44/1.05
% 0.44/1.05 ============================== INPUT =================================
% 0.44/1.05
% 0.44/1.05 % Reading from file /tmp/Prover9_21248_n013.cluster.edu
% 0.44/1.05
% 0.44/1.05 set(prolog_style_variables).
% 0.44/1.05 set(auto2).
% 0.44/1.05 % set(auto2) -> set(auto).
% 0.44/1.05 % set(auto) -> set(auto_inference).
% 0.44/1.05 % set(auto) -> set(auto_setup).
% 0.44/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.05 % set(auto) -> set(auto_limits).
% 0.44/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.05 % set(auto) -> set(auto_denials).
% 0.44/1.05 % set(auto) -> set(auto_process).
% 0.44/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.05 % set(auto2) -> assign(stats, some).
% 0.44/1.05 % set(auto2) -> clear(echo_input).
% 0.44/1.05 % set(auto2) -> set(quiet).
% 0.44/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.05 % set(auto2) -> clear(print_given).
% 0.44/1.05 assign(lrs_ticks,-1).
% 0.44/1.05 assign(sos_limit,10000).
% 0.44/1.05 assign(order,kbo).
% 0.44/1.05 set(lex_order_vars).
% 0.44/1.05 clear(print_given).
% 0.44/1.05
% 0.44/1.05 % formulas(sos). % not echoed (200 formulas)
% 0.44/1.05
% 0.44/1.05 ============================== end of input ==========================
% 0.44/1.05
% 0.44/1.05 % From the command line: assign(max_seconds, 300).
% 0.44/1.05
% 0.44/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.05
% 0.44/1.05 % Formulas that are not ordinary clauses:
% 0.44/1.05
% 0.44/1.05 ============================== end of process non-clausal formulas ===
% 0.44/1.05
% 0.44/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.05
% 0.44/1.05 ============================== PREDICATE ELIMINATION =================
% 0.44/1.05 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.44/1.05 2 equalelemsP(nil) # label(clause1) # label(axiom). [assumption].
% 0.44/1.05 3 -ssItem(A) | equalelemsP(cons(A,nil)) # label(clause64) # label(axiom). [assumption].
% 0.44/1.05 4 skaf79(A) != skaf78(A) | -ssList(A) | equalelemsP(A) # label(clause89) # label(axiom). [assumption].
% 0.44/1.05 5 -ssList(A) | equalelemsP(A) | app(skaf80(A),cons(skaf78(A),cons(skaf79(A),skaf81(A)))) = A # label(clause142) # label(axiom). [assumption].
% 0.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 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.44/1.05 6 equalelemsP(sk3) # label(co1_9) # label(negated_conjecture). [assumption].
% 0.44/1.05 Derived: app(A,cons(B,cons(C,D))) != sk3 | -ssList(D) | -ssList(A) | -ssItem(C) | -ssItem(B) | -ssList(sk3) | B = C. [resolve(6,a,1,f)].
% 0.44/1.05 7 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.44/1.05 8 duplicatefreeP(nil) # label(clause2) # label(axiom). [assumption].
% 0.44/1.05 9 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(clause65) # label(axiom). [assumption].
% 0.44/1.06 10 -ssList(A) | duplicatefreeP(A) | ssItem(B) # label(clause72) # label(axiom). [assumption].
% 0.44/1.06 11 -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.44/1.06 Derived: app(app(A,cons(B,C)),cons(B,D)) != nil | -ssList(D) | -ssList(C) | -ssList(A) | -ssItem(B) | -ssList(nil). [resolve(7,f,8,a)].
% 0.44/1.06 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(7,f,9,b)].
% 0.44/1.06 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(7,f,10,b)].
% 0.44/1.06 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(7,f,11,b)].
% 0.44/1.06 12 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.44/1.06 13 strictorderP(nil) # label(clause5) # label(axiom). [assumption].
% 0.44/1.06 14 -ssItem(A) | strictorderP(cons(A,nil)) # label(clause68) # label(axiom). [assumption].
% 0.44/1.06 15 -lt(skaf60(A),skaf59(A)) | -ssList(A) | strictorderP(A) # label(clause92) # label(axiom). [assumption].
% 0.44/1.06 16 -lt(skaf59(A),skaf60(A)) | -ssList(A) | strictorderP(A) # label(clause93) # label(axiom). [assumption].
% 0.44/1.06 17 -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.44/1.06 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(12,g,13,a)].
% 0.44/1.06 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(12,g,14,b)].
% 0.44/1.06 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(12,g,15,c)].
% 0.44/1.06 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(12,g,16,c)].
% 0.44/1.06 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(12,g,17,b)].
% 0.44/1.06 18 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.44/1.06 19 totalorderP(nil) # label(clause6) # label(axiom). [assumption].
% 0.44/1.06 20 -ssItem(A) | totalorderP(cons(A,nil)) # label(clause69) # label(axiom). [assumption].
% 0.44/1.06 21 -leq(skaf55(A),skaf54(A)) | -ssList(A) | totalorderP(A) # label(clause94) # label(axiom). [assumption].
% 0.44/1.06 22 -leq(skaf54(A),skaf55(A)) | -ssList(A) | totalorderP(A) # label(clause95) # label(axiom). [assumption].
% 0.44/1.06 23 -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.44/1.06 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(18,g,19,a)].
% 0.44/1.06 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(18,g,20,b)].
% 0.44/1.06 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(18,g,21,c)].
% 2.26/2.60 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(18,g,22,c)].
% 2.26/2.60 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(18,g,23,b)].
% 2.26/2.60 24 -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.26/2.60 25 cyclefreeP(nil) # label(clause7) # label(axiom). [assumption].
% 2.26/2.60 26 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(clause70) # label(axiom). [assumption].
% 2.26/2.60 27 -ssList(A) | cyclefreeP(A) | leq(skaf50(A),skaf49(A)) # label(clause87) # label(axiom). [assumption].
% 2.26/2.60 28 -ssList(A) | cyclefreeP(A) | leq(skaf49(A),skaf50(A)) # label(clause88) # label(axiom). [assumption].
% 2.26/2.60 29 -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.26/2.60 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(24,i,25,a)].
% 2.26/2.60 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(24,i,26,b)].
% 2.26/2.60 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(24,i,27,b)].
% 2.26/2.60 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(24,i,28,b)].
% 2.26/2.60 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(24,i,29,b)].
% 2.26/2.60
% 2.26/2.60 ============================== end predicate elimination =============
% 2.26/2.60
% 2.26/2.60 Auto_denials: (non-Horn, no changes).
% 2.26/2.60
% 2.26/2.60 Term ordering decisions:
% 2.26/2.60 Function symbol KB weights: nil=1. sk2=1. sk3=1. sk1=1. sk4=1. sk5=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.26/2.60
% 2.26/2.60 ============================== end of process initial clauses ========
% 2.26/2.60
% 2.26/2.60 ============================== CLAUSES FOR SEARCH ====================
% 2.26/2.60
% 2.26/2.60 ============================== end of clauses for search =============
% 2.26/2.60
% 2.26/2.60 ============================== SEARCH ================================
% 2.26/2.60
% 2.26/2.60 % Starting search at 0.20 seconds.
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=26.000, iters=3602
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=24.000, iters=3512
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=22.000, iters=3493
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=20.000, iters=3469
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=18.000, iters=3378
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=17.000, iters=3334
% 2.26/2.60
% 2.26/2.60 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 459 (0.00 of 0.79 sec).
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=16.000, iters=3627
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=15.000, iters=3348
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=14.000, iters=3334
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=13.000, iters=3340
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=12.000, iters=3351
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=11.000, iters=3337
% 2.26/2.60
% 2.26/2.60 Low Water (keep): wt=10.000, iters=3334
% 2.26/2.60
% 2.26/2.60 Low Water (displace): id=2578, wt=32.000
% 2.26/2.60
% 2.26/2.60 Low Water (displace): id=3201, wt=29.000
% 2.26/2.60
% 2.26/2.60 Low Water (displace): id=3695, wt=28.000
% 2.26/2.60
% 2.26/2.60 Low Water (displace): id=3696, wt=26.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=3222, wt=25.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=3664, wt=24.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=3231, wt=22.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=3373, wt=21.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=3509, wt=20.000
% 108.58/108.82
% 108.58/108.82 Low Water (keep): wt=9.000, iters=3396
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=9428, wt=19.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=3475, wt=18.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=8185, wt=17.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=3477, wt=16.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=8170, wt=15.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=3781, wt=13.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=13511, wt=11.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=9451, wt=10.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=14363, wt=9.000
% 108.58/108.82
% 108.58/108.82 Low Water (displace): id=14456, wt=7.000
% 108.58/108.82
% 108.58/108.82 Low Water (keep): wt=8.000, iters=3360
% 108.58/108.82
% 108.58/108.82 Low Water (keep): wt=7.000, iters=3352
% 108.58/108.82
% 108.58/108.82 ============================== PROOF =================================
% 108.58/108.82 % SZS status Unsatisfiable
% 108.58/108.82 % SZS output start Refutation
% 108.58/108.82
% 108.58/108.82 % Proof 1 at 101.64 (+ 6.17) seconds.
% 108.58/108.82 % Length of proof is 40.
% 108.58/108.82 % Level of proof is 10.
% 108.58/108.82 % Maximum clause weight is 18.000.
% 108.58/108.82 % Given clauses 22595.
% 108.58/108.82
% 108.58/108.82 32 ssList(nil) # label(clause8) # label(axiom). [assumption].
% 108.58/108.82 80 -ssList(A) | segmentP(A,nil) # label(clause56) # label(axiom). [assumption].
% 108.58/108.82 81 -ssList(A) | segmentP(A,A) # label(clause57) # label(axiom). [assumption].
% 108.58/108.82 92 -ssList(A) | app(nil,A) = A # label(clause74) # label(axiom). [assumption].
% 108.58/108.82 109 -ssList(A) | -ssList(B) | neq(B,A) | B = A # label(clause100) # label(axiom). [assumption].
% 108.58/108.82 135 -segmentP(A,B) | -segmentP(B,A) | -ssList(A) | -ssList(B) | B = A # label(clause127) # label(axiom). [assumption].
% 108.58/108.82 176 -segmentP(A,B) | -ssList(C) | -ssList(D) | -ssList(B) | -ssList(A) | segmentP(app(app(D,A),C),B) # label(clause172) # label(axiom). [assumption].
% 108.58/108.82 186 ssList(sk2) # label(co1_2) # label(negated_conjecture). [assumption].
% 108.58/108.82 187 ssList(sk3) # label(co1_3) # label(negated_conjecture). [assumption].
% 108.58/108.82 189 sk2 = sk4 # label(co1_5) # label(negated_conjecture). [assumption].
% 108.58/108.82 190 sk4 = sk2. [copy(189),flip(a)].
% 108.58/108.82 191 sk1 = sk3 # label(co1_6) # label(negated_conjecture). [assumption].
% 108.58/108.82 192 ssList(sk5) # label(co1_7) # label(negated_conjecture). [assumption].
% 108.58/108.82 193 app(sk3,sk5) = sk4 # label(co1_8) # label(negated_conjecture). [assumption].
% 108.58/108.82 194 app(sk3,sk5) = sk2. [copy(193),rewrite([190(4)])].
% 108.58/108.82 196 nil = sk4 | nil != sk3 # label(co1_11) # label(negated_conjecture). [assumption].
% 108.58/108.82 197 sk2 = nil | sk3 != nil. [copy(196),rewrite([190(2)]),flip(a),flip(b)].
% 108.58/108.82 200 nil = sk2 | -neq(sk1,nil) | -segmentP(sk2,sk1) # label(co1_13) # label(negated_conjecture). [assumption].
% 108.58/108.82 201 sk2 = nil | -neq(sk3,nil) | -segmentP(sk2,sk3). [copy(200),rewrite([191(4),191(8)]),flip(a)].
% 108.58/108.82 202 nil != sk1 | neq(sk2,nil) # label(co1_14) # label(negated_conjecture). [assumption].
% 108.58/108.82 203 sk3 != nil | neq(sk2,nil). [copy(202),rewrite([191(2)]),flip(a)].
% 108.58/108.82 204 nil != sk1 | -neq(sk1,nil) | -segmentP(sk2,sk1) # label(co1_15) # label(negated_conjecture). [assumption].
% 108.58/108.82 205 sk3 != nil | -neq(sk3,nil) | -segmentP(sk2,sk3). [copy(204),rewrite([191(2),191(4),191(8)]),flip(a)].
% 108.58/108.82 290 -segmentP(A,A) | -ssList(B) | -ssList(C) | -ssList(A) | segmentP(app(app(C,A),B),A). [factor(176,d,e)].
% 108.58/108.82 1405 -ssList(A) | neq(A,nil) | nil = A. [resolve(109,a,32,a),flip(c)].
% 108.58/108.82 3344 app(nil,sk3) = sk3. [resolve(187,a,92,a)].
% 108.58/108.82 3350 segmentP(sk3,sk3). [resolve(187,a,81,a)].
% 108.58/108.82 3351 segmentP(sk3,nil). [resolve(187,a,80,a)].
% 108.58/108.82 5237 -ssList(A) | -ssList(B) | segmentP(app(app(B,sk3),A),sk3). [resolve(3350,a,290,a),unit_del(c,187)].
% 108.58/108.82 41748 neq(sk3,nil) | sk3 = nil. [resolve(1405,a,187,a),flip(b)].
% 108.58/108.82 124112 -ssList(A) | segmentP(app(sk3,A),sk3). [resolve(5237,b,32,a),rewrite([3344(4)])].
% 108.58/108.82 124356 segmentP(sk2,sk3). [resolve(124112,a,192,a),rewrite([194(3)])].
% 108.58/108.82 124385 sk3 != nil | -neq(sk3,nil). [back_unit_del(205),unit_del(c,124356)].
% 108.58/108.82 124386 sk2 = nil | -neq(sk3,nil). [back_unit_del(201),unit_del(c,124356)].
% 108.58/108.82 124393 -segmentP(sk3,sk2) | sk3 = sk2. [resolve(124356,a,135,b),flip(d),unit_del(b,187),unit_del(c,186)].
% 108.58/108.82 124460 sk2 = nil | sk3 = nil. [resolve(124386,b,41748,a)].
% 108.58/108.82 124465 sk2 = nil. [resolve(124460,b,197,b),merge(b)].
% 108.58/108.82 124466 sk3 = nil. [back_rewrite(124393),rewrite([124465(2),124465(5)]),unit_del(a,3351)].
% 108.58/108.82 125350 neq(nil,nil). [back_rewrite(203),rewrite([124466(1),124465(4)]),xx(a)].
% 108.58/108.82 125352 $F. [back_rewrite(124385),rewrite([124466(1),124466(4)]),xx(a),unit_del(a,125350)].
% 108.58/108.82
% 108.58/108.82 % SZS output end Refutation
% 108.58/108.82 ============================== end of proof ==========================
% 108.58/108.82
% 108.58/108.82 ============================== STATISTICS ============================
% 108.58/108.82
% 108.58/108.82 Given=22595. Generated=11451651. Kept=125295. proofs=1.
% 108.58/108.82 Usable=17080. Sos=4482. Demods=348. Limbo=886, Disabled=103071. Hints=0.
% 108.58/108.82 Megabytes=61.68.
% 108.58/108.82 User_CPU=101.64, System_CPU=6.17, Wall_clock=108.
% 108.58/108.82
% 108.58/108.82 ============================== end of statistics =====================
% 108.58/108.82
% 108.58/108.82 ============================== end of search =========================
% 108.58/108.82
% 108.58/108.82 THEOREM PROVED
% 108.58/108.82 % SZS status Unsatisfiable
% 108.58/108.82
% 108.58/108.82 Exiting with 1 proof.
% 108.58/108.82
% 108.58/108.82 Process 21401 exit (max_proofs) Mon Jun 13 00:41:32 2022
% 108.58/108.82 Prover9 interrupted
%------------------------------------------------------------------------------