TSTP Solution File: SWC007-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWC007-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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:43 EDT 2022
% Result : Unsatisfiable 12.68s 12.95s
% Output : Refutation 12.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC007-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 : n014.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 08:26:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.46/1.05 ============================== Prover9 ===============================
% 0.46/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.05 Process 31050 was started by sandbox2 on n014.cluster.edu,
% 0.46/1.05 Sun Jun 12 08:26:23 2022
% 0.46/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_30897_n014.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_30897_n014.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 (193 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
% 0.46/1.05 ============================== end of process non-clausal formulas ===
% 0.46/1.05
% 0.46/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.05
% 0.46/1.05 ============================== PREDICATE ELIMINATION =================
% 0.46/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.46/1.05 2 equalelemsP(nil) # label(clause1) # label(axiom). [assumption].
% 0.46/1.05 3 -ssItem(A) | equalelemsP(cons(A,nil)) # label(clause64) # label(axiom). [assumption].
% 0.46/1.05 4 skaf79(A) != skaf78(A) | -ssList(A) | equalelemsP(A) # label(clause89) # label(axiom). [assumption].
% 0.46/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.46/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.46/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.46/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.46/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.46/1.05 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.46/1.05 7 duplicatefreeP(nil) # label(clause2) # label(axiom). [assumption].
% 0.46/1.05 8 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(clause65) # label(axiom). [assumption].
% 0.46/1.05 9 -ssList(A) | duplicatefreeP(A) | ssItem(B) # label(clause72) # label(axiom). [assumption].
% 0.46/1.05 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.79/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.79/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.79/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.79/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.79/1.06 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.79/1.06 12 strictorderP(nil) # label(clause5) # label(axiom). [assumption].
% 0.79/1.06 13 -ssItem(A) | strictorderP(cons(A,nil)) # label(clause68) # label(axiom). [assumption].
% 0.79/1.06 14 -lt(skaf60(A),skaf59(A)) | -ssList(A) | strictorderP(A) # label(clause92) # label(axiom). [assumption].
% 0.79/1.06 15 -lt(skaf59(A),skaf60(A)) | -ssList(A) | strictorderP(A) # label(clause93) # label(axiom). [assumption].
% 0.79/1.06 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.79/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(11,g,12,a)].
% 0.79/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(11,g,13,b)].
% 0.79/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(11,g,14,c)].
% 0.79/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(11,g,15,c)].
% 0.79/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(11,g,16,b)].
% 0.79/1.06 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.79/1.06 18 totalorderP(nil) # label(clause6) # label(axiom). [assumption].
% 0.79/1.06 19 -ssItem(A) | totalorderP(cons(A,nil)) # label(clause69) # label(axiom). [assumption].
% 0.79/1.06 20 -leq(skaf55(A),skaf54(A)) | -ssList(A) | totalorderP(A) # label(clause94) # label(axiom). [assumption].
% 0.79/1.06 21 -leq(skaf54(A),skaf55(A)) | -ssList(A) | totalorderP(A) # label(clause95) # label(axiom). [assumption].
% 0.79/1.06 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.79/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(17,g,18,a)].
% 0.79/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(17,g,19,b)].
% 0.79/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(17,g,20,c)].
% 0.79/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(skaf54(F),skaf55(F)) | -ssList(F). [resolve(17,g,21,c)].
% 2.22/2.51 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.22/2.51 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.22/2.51 24 cyclefreeP(nil) # label(clause7) # label(axiom). [assumption].
% 2.22/2.51 25 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(clause70) # label(axiom). [assumption].
% 2.22/2.51 26 -ssList(A) | cyclefreeP(A) | leq(skaf50(A),skaf49(A)) # label(clause87) # label(axiom). [assumption].
% 2.22/2.51 27 -ssList(A) | cyclefreeP(A) | leq(skaf49(A),skaf50(A)) # label(clause88) # label(axiom). [assumption].
% 2.22/2.51 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.22/2.51 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.22/2.51 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.22/2.51 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.22/2.51 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.22/2.51 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.22/2.51 29 A != B | -neq(A,B) | -ssList(B) | -ssList(A) # label(clause115) # label(axiom). [assumption].
% 2.22/2.51 30 -ssList(A) | -ssList(B) | neq(B,A) | B = A # label(clause100) # label(axiom). [assumption].
% 2.22/2.51 31 -ssItem(A) | -ssItem(B) | neq(B,A) | B = A # label(clause102) # label(axiom). [assumption].
% 2.22/2.51 32 A != B | -neq(A,B) | -ssItem(B) | -ssItem(A) # label(clause117) # label(axiom). [assumption].
% 2.22/2.51
% 2.22/2.51 ============================== end predicate elimination =============
% 2.22/2.51
% 2.22/2.51 Auto_denials: (non-Horn, no changes).
% 2.22/2.51
% 2.22/2.51 Term ordering decisions:
% 2.22/2.51 Function symbol KB weights: nil=1. sk3=1. sk1=1. sk2=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.
% 2.22/2.51
% 2.22/2.51 ============================== end of process initial clauses ========
% 2.22/2.51
% 2.22/2.51 ============================== CLAUSES FOR SEARCH ====================
% 2.22/2.51
% 2.22/2.51 ============================== end of clauses for search =============
% 2.22/2.51
% 2.22/2.51 ============================== SEARCH ================================
% 2.22/2.51
% 2.22/2.51 % Starting search at 0.20 seconds.
% 2.22/2.51
% 2.22/2.51 Low Water (keep): wt=28.000, iters=3443
% 2.22/2.51
% 2.22/2.51 Low Water (keep): wt=26.000, iters=3342
% 2.22/2.51
% 2.22/2.51 Low Water (keep): wt=22.000, iters=3438
% 2.22/2.51
% 2.22/2.51 Low Water (keep): wt=21.000, iters=3625
% 2.22/2.51
% 2.22/2.51 Low Water (keep): wt=20.000, iters=3581
% 2.22/2.51
% 2.22/2.51 Low Water (keep): wt=18.000, iters=3407
% 2.22/2.51
% 2.22/2.51 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 208 (0.00 of 0.86 sec).
% 2.22/2.51
% 2.22/2.51 Low Water (keep): wt=17.000, iters=3804
% 2.22/2.51
% 2.22/2.51 Low Water (keep): wt=16.000, iters=3585
% 2.22/2.51
% 2.22/2.51 Low Water (keep): wt=15.000, iters=3339
% 2.22/2.51
% 2.22/2.51 Low Water (keep): wt=14.000, iters=3625
% 2.22/2.51
% 2.22/2.51 Low Water (keep): wt=13.000, iters=3334
% 2.22/2.51
% 2.22/2.51 Low Water (keep): wt=12.000, iters=3418
% 2.22/2.51
% 2.22/2.51 Low Water (displace): id=2476, wt=32.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=3672, wt=29.000
% 12.68/12.95
% 12.68/12.95 Low Water (keep): wt=11.000, iters=3342
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=3735, wt=28.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=3743, wt=26.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=3775, wt=25.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=3771, wt=24.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=4401, wt=23.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=3765, wt=22.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=4493, wt=21.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=3404, wt=20.000
% 12.68/12.95
% 12.68/12.95 Low Water (keep): wt=10.000, iters=3340
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=12208, wt=19.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=13999, wt=18.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=12202, wt=17.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=8785, wt=16.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=8695, wt=15.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=5326, wt=14.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=14759, wt=13.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=5268, wt=12.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=14751, wt=11.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=15500, wt=10.000
% 12.68/12.95
% 12.68/12.95 Low Water (keep): wt=9.000, iters=3648
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=20750, wt=9.000
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=22445, wt=8.000
% 12.68/12.95
% 12.68/12.95 Low Water (keep): wt=8.000, iters=3354
% 12.68/12.95
% 12.68/12.95 Low Water (displace): id=32578, wt=7.000
% 12.68/12.95
% 12.68/12.95 ============================== PROOF =================================
% 12.68/12.95 % SZS status Unsatisfiable
% 12.68/12.95 % SZS output start Refutation
% 12.68/12.95
% 12.68/12.95 % Proof 1 at 11.52 (+ 0.41) seconds.
% 12.68/12.95 % Length of proof is 16.
% 12.68/12.95 % Level of proof is 6.
% 12.68/12.95 % Maximum clause weight is 18.000.
% 12.68/12.95 % Given clauses 5930.
% 12.68/12.95
% 12.68/12.95 35 ssList(nil) # label(clause8) # label(axiom). [assumption].
% 12.68/12.95 94 -ssList(A) | app(A,nil) = A # label(clause73) # label(axiom). [assumption].
% 12.68/12.95 95 -ssList(A) | app(nil,A) = A # label(clause74) # label(axiom). [assumption].
% 12.68/12.95 185 ssList(sk2) # label(co1_2) # label(negated_conjecture). [assumption].
% 12.68/12.95 188 nil = sk3 # label(co1_5) # label(negated_conjecture). [assumption].
% 12.68/12.95 189 sk3 = nil. [copy(188),flip(a)].
% 12.68/12.95 192 sk1 = sk3 # label(co1_7) # label(negated_conjecture). [assumption].
% 12.68/12.95 193 sk1 = nil. [copy(192),rewrite([189(2)])].
% 12.68/12.95 194 -ssList(A) | -ssList(B) | -ssList(C) | app(app(A,B),C) != sk2 | app(A,C) != sk1 # label(co1_8) # label(negated_conjecture). [assumption].
% 12.68/12.95 195 -ssList(A) | -ssList(B) | -ssList(C) | app(app(A,B),C) != sk2 | app(A,C) != nil. [copy(194),rewrite([193(9)])].
% 12.68/12.95 303 -ssList(A) | -ssList(B) | app(app(A,B),A) != sk2 | app(A,A) != nil. [factor(195,a,c)].
% 12.68/12.95 1062 app(nil,nil) = nil. [resolve(94,a,35,a)].
% 12.68/12.95 3170 app(nil,sk2) = sk2. [resolve(185,a,95,a)].
% 12.68/12.95 3171 app(sk2,nil) = sk2. [resolve(185,a,94,a)].
% 12.68/12.95 5297 -ssList(A) | app(app(nil,A),nil) != sk2. [resolve(303,a,35,a),rewrite([1062(10)]),xx(c)].
% 12.68/12.95 128680 $F. [resolve(5297,a,185,a),rewrite([3170(3),3171(3)]),xx(a)].
% 12.68/12.95
% 12.68/12.95 % SZS output end Refutation
% 12.68/12.95 ============================== end of proof ==========================
% 12.68/12.95
% 12.68/12.95 ============================== STATISTICS ============================
% 12.68/12.95
% 12.68/12.95 Given=5930. Generated=740794. Kept=128624. proofs=1.
% 12.68/12.95 Usable=5850. Sos=9995. Demods=514. Limbo=1280, Disabled=111715. Hints=0.
% 12.68/12.95 Megabytes=60.99.
% 12.68/12.95 User_CPU=11.52, System_CPU=0.41, Wall_clock=12.
% 12.68/12.95
% 12.68/12.95 ============================== end of statistics =====================
% 12.68/12.95
% 12.68/12.95 ============================== end of search =========================
% 12.68/12.95
% 12.68/12.95 THEOREM PROVED
% 12.68/12.95 % SZS status Unsatisfiable
% 12.68/12.95
% 12.68/12.95 Exiting with 1 proof.
% 12.68/12.95
% 12.68/12.95 Process 31050 exit (max_proofs) Sun Jun 12 08:26:35 2022
% 12.68/12.95 Prover9 interrupted
%------------------------------------------------------------------------------