TSTP Solution File: SWC025-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWC025-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:44:50 EDT 2022
% Result : Unsatisfiable 113.97s 114.32s
% Output : Refutation 113.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC025-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n026.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 : Sun Jun 12 04:03:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.77/1.06 ============================== Prover9 ===============================
% 0.77/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.06 Process 970 was started by sandbox on n026.cluster.edu,
% 0.77/1.06 Sun Jun 12 04:03:50 2022
% 0.77/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_800_n026.cluster.edu".
% 0.77/1.06 ============================== end of head ===========================
% 0.77/1.06
% 0.77/1.06 ============================== INPUT =================================
% 0.77/1.06
% 0.77/1.06 % Reading from file /tmp/Prover9_800_n026.cluster.edu
% 0.77/1.06
% 0.77/1.06 set(prolog_style_variables).
% 0.77/1.06 set(auto2).
% 0.77/1.06 % set(auto2) -> set(auto).
% 0.77/1.06 % set(auto) -> set(auto_inference).
% 0.77/1.06 % set(auto) -> set(auto_setup).
% 0.77/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.06 % set(auto) -> set(auto_limits).
% 0.77/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.06 % set(auto) -> set(auto_denials).
% 0.77/1.06 % set(auto) -> set(auto_process).
% 0.77/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.06 % set(auto2) -> assign(stats, some).
% 0.77/1.06 % set(auto2) -> clear(echo_input).
% 0.77/1.06 % set(auto2) -> set(quiet).
% 0.77/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.06 % set(auto2) -> clear(print_given).
% 0.77/1.06 assign(lrs_ticks,-1).
% 0.77/1.06 assign(sos_limit,10000).
% 0.77/1.06 assign(order,kbo).
% 0.77/1.06 set(lex_order_vars).
% 0.77/1.06 clear(print_given).
% 0.77/1.06
% 0.77/1.06 % formulas(sos). % not echoed (198 formulas)
% 0.77/1.06
% 0.77/1.06 ============================== end of input ==========================
% 0.77/1.06
% 0.77/1.06 % From the command line: assign(max_seconds, 300).
% 0.77/1.06
% 0.77/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.06
% 0.77/1.06 % Formulas that are not ordinary clauses:
% 0.77/1.06
% 0.77/1.06 ============================== end of process non-clausal formulas ===
% 0.77/1.06
% 0.77/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.06
% 0.77/1.06 ============================== PREDICATE ELIMINATION =================
% 0.77/1.06 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.77/1.06 2 equalelemsP(nil) # label(clause1) # label(axiom). [assumption].
% 0.77/1.06 3 -ssItem(A) | equalelemsP(cons(A,nil)) # label(clause64) # label(axiom). [assumption].
% 0.77/1.06 4 skaf79(A) != skaf78(A) | -ssList(A) | equalelemsP(A) # label(clause89) # label(axiom). [assumption].
% 0.77/1.06 5 -ssList(A) | equalelemsP(A) | app(skaf80(A),cons(skaf78(A),cons(skaf79(A),skaf81(A)))) = A # label(clause142) # label(axiom). [assumption].
% 0.77/1.06 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.77/1.06 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.77/1.06 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.77/1.06 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.77/1.06 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.77/1.06 7 duplicatefreeP(nil) # label(clause2) # label(axiom). [assumption].
% 0.77/1.06 8 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(clause65) # label(axiom). [assumption].
% 0.77/1.06 9 -ssList(A) | duplicatefreeP(A) | ssItem(B) # label(clause72) # label(axiom). [assumption].
% 0.77/1.06 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.77/1.06 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.77/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(6,f,8,b)].
% 0.77/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(6,f,9,b)].
% 0.77/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(6,f,10,b)].
% 0.77/1.06 11 duplicatefreeP(sk3) # label(co1_7) # label(negated_conjecture). [assumption].
% 0.77/1.06 Derived: app(app(A,cons(B,C)),cons(B,D)) != sk3 | -ssList(D) | -ssList(C) | -ssList(A) | -ssItem(B) | -ssList(sk3). [resolve(11,a,6,f)].
% 0.77/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.77/1.06 13 strictorderP(nil) # label(clause5) # label(axiom). [assumption].
% 0.77/1.06 14 -ssItem(A) | strictorderP(cons(A,nil)) # label(clause68) # label(axiom). [assumption].
% 0.77/1.06 15 -lt(skaf60(A),skaf59(A)) | -ssList(A) | strictorderP(A) # label(clause92) # label(axiom). [assumption].
% 0.77/1.06 16 -lt(skaf59(A),skaf60(A)) | -ssList(A) | strictorderP(A) # label(clause93) # label(axiom). [assumption].
% 0.77/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.77/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.77/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.77/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.77/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.77/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.77/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.77/1.06 19 totalorderP(nil) # label(clause6) # label(axiom). [assumption].
% 0.77/1.06 20 -ssItem(A) | totalorderP(cons(A,nil)) # label(clause69) # label(axiom). [assumption].
% 0.77/1.06 21 -leq(skaf55(A),skaf54(A)) | -ssList(A) | totalorderP(A) # label(clause94) # label(axiom). [assumption].
% 0.77/1.06 22 -leq(skaf54(A),skaf55(A)) | -ssList(A) | totalorderP(A) # label(clause95) # label(axiom). [assumption].
% 0.77/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.77/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.77/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.77/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)].
% 1.58/1.91 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)].
% 1.58/1.91 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)].
% 1.58/1.91 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].
% 1.58/1.91 25 cyclefreeP(nil) # label(clause7) # label(axiom). [assumption].
% 1.58/1.91 26 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(clause70) # label(axiom). [assumption].
% 1.58/1.91 27 -ssList(A) | cyclefreeP(A) | leq(skaf50(A),skaf49(A)) # label(clause87) # label(axiom). [assumption].
% 1.58/1.91 28 -ssList(A) | cyclefreeP(A) | leq(skaf49(A),skaf50(A)) # label(clause88) # label(axiom). [assumption].
% 1.58/1.91 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].
% 1.58/1.91 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)].
% 1.58/1.91 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)].
% 1.58/1.91 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)].
% 1.58/1.91 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)].
% 1.58/1.91 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)].
% 1.58/1.91 30 A != B | -neq(A,B) | -ssList(B) | -ssList(A) # label(clause115) # label(axiom). [assumption].
% 1.58/1.91 31 -ssList(A) | -ssList(B) | neq(B,A) | B = A # label(clause100) # label(axiom). [assumption].
% 1.58/1.91 32 -ssItem(A) | -ssItem(B) | neq(B,A) | B = A # label(clause102) # label(axiom). [assumption].
% 1.58/1.91 33 A != B | -neq(A,B) | -ssItem(B) | -ssItem(A) # label(clause117) # label(axiom). [assumption].
% 1.58/1.91
% 1.58/1.91 ============================== end predicate elimination =============
% 1.58/1.91
% 1.58/1.91 Auto_denials: (non-Horn, no changes).
% 1.58/1.91
% 1.58/1.91 Term ordering decisions:
% 1.58/1.91 Function symbol KB weights: nil=1. sk1=1. sk2=1. sk3=1. sk4=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.
% 1.58/1.91
% 1.58/1.91 ============================== end of process initial clauses ========
% 1.58/1.91
% 1.58/1.91 ============================== CLAUSES FOR SEARCH ====================
% 1.58/1.91
% 1.58/1.91 ============================== end of clauses for search =============
% 1.58/1.91
% 1.58/1.91 ============================== SEARCH ================================
% 1.58/1.91
% 1.58/1.91 % Starting search at 0.20 seconds.
% 1.58/1.91
% 1.58/1.91 Low Water (keep): wt=30.000, iters=3688
% 1.58/1.91
% 1.58/1.91 Low Water (keep): wt=26.000, iters=3505
% 1.58/1.91
% 1.58/1.91 Low Water (keep): wt=25.000, iters=3416
% 1.58/1.91
% 1.58/1.91 Low Water (keep): wt=22.000, iters=3521
% 1.58/1.91
% 1.58/1.91 Low Water (keep): wt=21.000, iters=3715
% 1.58/1.91
% 1.58/1.91 Low Water (keep): wt=20.000, iters=3678
% 1.58/1.91
% 1.58/1.91 Low Water (keep): wt=18.000, iters=3506
% 1.58/1.91
% 1.58/1.91 Low Water (keep): wt=17.000, iters=3376
% 1.58/1.91
% 1.58/1.91 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 501 (0.00 of 0.87 sec).
% 113.97/114.32
% 113.97/114.32 Low Water (keep): wt=16.000, iters=3371
% 113.97/114.32
% 113.97/114.32 Low Water (keep): wt=15.000, iters=3340
% 113.97/114.32
% 113.97/114.32 Low Water (keep): wt=14.000, iters=3378
% 113.97/114.32
% 113.97/114.32 Low Water (keep): wt=13.000, iters=3362
% 113.97/114.32
% 113.97/114.32 Low Water (keep): wt=12.000, iters=3333
% 113.97/114.32
% 113.97/114.32 Low Water (keep): wt=11.000, iters=3344
% 113.97/114.32
% 113.97/114.32 Low Water (keep): wt=10.000, iters=3341
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=2485, wt=32.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=3730, wt=30.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=3575, wt=29.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=3706, wt=28.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=3714, wt=26.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=3129, wt=25.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=3734, wt=24.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=4344, wt=23.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=3715, wt=22.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=4436, wt=21.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=3307, wt=20.000
% 113.97/114.32
% 113.97/114.32 Low Water (keep): wt=9.000, iters=3333
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=9475, wt=19.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=8354, wt=17.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=8339, wt=15.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=13924, wt=13.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=13977, wt=11.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=14497, wt=10.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=18339, wt=9.000
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=18509, wt=8.000
% 113.97/114.32
% 113.97/114.32 Low Water (keep): wt=8.000, iters=3359
% 113.97/114.32
% 113.97/114.32 Low Water (displace): id=30477, wt=7.000
% 113.97/114.32
% 113.97/114.32 Low Water (keep): wt=7.000, iters=3334
% 113.97/114.32
% 113.97/114.32 ============================== PROOF =================================
% 113.97/114.32 % SZS status Unsatisfiable
% 113.97/114.32 % SZS output start Refutation
% 113.97/114.32
% 113.97/114.32 % Proof 1 at 107.32 (+ 5.98) seconds.
% 113.97/114.32 % Length of proof is 34.
% 113.97/114.32 % Level of proof is 10.
% 113.97/114.32 % Maximum clause weight is 14.000.
% 113.97/114.32 % Given clauses 23271.
% 113.97/114.32
% 113.97/114.32 40 ssItem(skaf83(A)) # label(clause12) # label(axiom). [assumption].
% 113.97/114.32 41 ssList(skaf82(A)) # label(clause13) # label(axiom). [assumption].
% 113.97/114.32 94 -memberP(nil,A) | -ssItem(A) # label(clause71) # label(axiom). [assumption].
% 113.97/114.32 120 -ssList(A) | cons(skaf83(A),skaf82(A)) = A | nil = A # label(clause109) # label(axiom). [assumption].
% 113.97/114.32 146 A != B | -ssList(C) | -ssItem(B) | -ssItem(A) | memberP(cons(B,C),A) # label(clause138) # label(axiom). [assumption].
% 113.97/114.32 185 ssList(sk1) # label(co1_1) # label(negated_conjecture). [assumption].
% 113.97/114.32 186 ssList(sk2) # label(co1_2) # label(negated_conjecture). [assumption].
% 113.97/114.32 189 sk2 = sk4 # label(co1_5) # label(negated_conjecture). [assumption].
% 113.97/114.32 190 sk4 = sk2. [copy(189),flip(a)].
% 113.97/114.32 191 sk1 = sk3 # label(co1_6) # label(negated_conjecture). [assumption].
% 113.97/114.32 192 sk3 = sk1. [copy(191),flip(a)].
% 113.97/114.32 193 -ssItem(A) | memberP(sk4,A) | -memberP(sk3,A) # label(co1_8) # label(negated_conjecture). [assumption].
% 113.97/114.32 194 -ssItem(A) | memberP(sk2,A) | -memberP(sk1,A). [copy(193),rewrite([190(2),192(4)])].
% 113.97/114.32 195 -ssItem(A) | memberP(sk3,A) | -memberP(sk4,A) # label(co1_9) # label(negated_conjecture). [assumption].
% 113.97/114.32 196 -ssItem(A) | memberP(sk1,A) | -memberP(sk2,A). [copy(195),rewrite([192(2),190(4)])].
% 113.97/114.32 197 nil = sk2 | nil = sk1 # label(co1_10) # label(negated_conjecture). [assumption].
% 113.97/114.32 198 sk2 = nil | sk1 = nil. [copy(197),flip(a),flip(b)].
% 113.97/114.32 201 nil != sk1 | nil != sk2 # label(co1_13) # label(negated_conjecture). [assumption].
% 113.97/114.32 202 sk1 != nil | sk2 != nil. [copy(201),flip(a),flip(b)].
% 113.97/114.32 260 -ssList(A) | -ssItem(B) | memberP(cons(B,A),B). [factor(146,c,d),xx(a)].
% 113.97/114.32 3170 cons(skaf83(sk1),skaf82(sk1)) = sk1 | sk1 = nil. [resolve(185,a,120,a),flip(b)].
% 113.97/114.32 3238 cons(skaf83(sk2),skaf82(sk2)) = sk2 | sk2 = nil. [resolve(186,a,120,a),flip(b)].
% 113.97/114.32 4794 -ssList(A) | memberP(cons(skaf83(B),A),skaf83(B)). [resolve(260,b,40,a)].
% 113.97/114.32 148938 memberP(cons(skaf83(A),skaf82(B)),skaf83(A)). [resolve(4794,a,41,a)].
% 113.97/114.32 153041 sk1 = nil | memberP(sk1,skaf83(sk1)). [para(3170(a,1),148938(a,1))].
% 113.97/114.32 153042 sk2 = nil | memberP(sk2,skaf83(sk2)). [para(3238(a,1),148938(a,1))].
% 113.97/114.32 153043 sk1 = nil | memberP(sk2,skaf83(sk1)). [resolve(153041,b,194,c),unit_del(b,40)].
% 113.97/114.32 153044 sk2 = nil | memberP(sk1,skaf83(sk2)). [resolve(153042,b,196,c),unit_del(b,40)].
% 113.97/114.32 153045 sk1 = nil | memberP(nil,skaf83(sk1)). [para(198(a,1),153043(b,1)),merge(b)].
% 113.97/114.32 153048 sk1 = nil. [resolve(153045,b,94,a),unit_del(b,40)].
% 113.97/114.32 153049 sk2 = nil | memberP(nil,skaf83(sk2)). [back_rewrite(153044),rewrite([153048(4)])].
% 113.97/114.32 155270 sk2 != nil. [back_rewrite(202),rewrite([153048(1)]),xx(a)].
% 113.97/114.32 155274 memberP(nil,skaf83(sk2)). [back_unit_del(153049),unit_del(a,155270)].
% 113.97/114.32 155797 $F. [resolve(155274,a,94,a),unit_del(a,40)].
% 113.97/114.32
% 113.97/114.32 % SZS output end Refutation
% 113.97/114.32 ============================== end of proof ==========================
% 113.97/114.32
% 113.97/114.32 ============================== STATISTICS ============================
% 113.97/114.32
% 113.97/114.32 Given=23271. Generated=11720681. Kept=155735. proofs=1.
% 113.97/114.32 Usable=16996. Sos=6432. Demods=412. Limbo=3, Disabled=132526. Hints=0.
% 113.97/114.32 Megabytes=72.80.
% 113.97/114.32 User_CPU=107.32, System_CPU=5.98, Wall_clock=113.
% 113.97/114.32
% 113.97/114.32 ============================== end of statistics =====================
% 113.97/114.32
% 113.97/114.32 ============================== end of search =========================
% 113.97/114.32
% 113.97/114.32 THEOREM PROVED
% 113.97/114.32 % SZS status Unsatisfiable
% 113.97/114.32
% 113.97/114.32 Exiting with 1 proof.
% 113.97/114.32
% 113.97/114.32 Process 970 exit (max_proofs) Sun Jun 12 04:05:43 2022
% 113.97/114.32 Prover9 interrupted
%------------------------------------------------------------------------------