TSTP Solution File: SWC103-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWC103-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:21 EDT 2022
% Result : Unsatisfiable 0.79s 1.10s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWC103-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 21:34:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/1.06 ============================== Prover9 ===============================
% 0.45/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.06 Process 27453 was started by sandbox2 on n017.cluster.edu,
% 0.45/1.06 Sun Jun 12 21:34:38 2022
% 0.45/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27159_n017.cluster.edu".
% 0.45/1.06 ============================== end of head ===========================
% 0.45/1.06
% 0.45/1.06 ============================== INPUT =================================
% 0.45/1.06
% 0.45/1.06 % Reading from file /tmp/Prover9_27159_n017.cluster.edu
% 0.45/1.06
% 0.45/1.06 set(prolog_style_variables).
% 0.45/1.06 set(auto2).
% 0.45/1.06 % set(auto2) -> set(auto).
% 0.45/1.06 % set(auto) -> set(auto_inference).
% 0.45/1.06 % set(auto) -> set(auto_setup).
% 0.45/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.06 % set(auto) -> set(auto_limits).
% 0.45/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.06 % set(auto) -> set(auto_denials).
% 0.45/1.06 % set(auto) -> set(auto_process).
% 0.45/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.06 % set(auto2) -> assign(stats, some).
% 0.45/1.06 % set(auto2) -> clear(echo_input).
% 0.45/1.06 % set(auto2) -> set(quiet).
% 0.45/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.06 % set(auto2) -> clear(print_given).
% 0.45/1.06 assign(lrs_ticks,-1).
% 0.45/1.06 assign(sos_limit,10000).
% 0.45/1.06 assign(order,kbo).
% 0.45/1.06 set(lex_order_vars).
% 0.45/1.06 clear(print_given).
% 0.45/1.06
% 0.45/1.06 % formulas(sos). % not echoed (196 formulas)
% 0.45/1.06
% 0.45/1.06 ============================== end of input ==========================
% 0.45/1.06
% 0.45/1.06 % From the command line: assign(max_seconds, 300).
% 0.45/1.06
% 0.45/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.06
% 0.45/1.06 % Formulas that are not ordinary clauses:
% 0.45/1.06
% 0.45/1.06 ============================== end of process non-clausal formulas ===
% 0.45/1.06
% 0.45/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.06
% 0.45/1.06 ============================== PREDICATE ELIMINATION =================
% 0.45/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.45/1.06 2 equalelemsP(nil) # label(clause1) # label(axiom). [assumption].
% 0.45/1.06 3 -ssItem(A) | equalelemsP(cons(A,nil)) # label(clause64) # label(axiom). [assumption].
% 0.45/1.06 4 skaf79(A) != skaf78(A) | -ssList(A) | equalelemsP(A) # label(clause89) # label(axiom). [assumption].
% 0.45/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.45/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.45/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.45/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.45/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.45/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.45/1.06 7 duplicatefreeP(nil) # label(clause2) # label(axiom). [assumption].
% 0.45/1.06 8 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(clause65) # label(axiom). [assumption].
% 0.45/1.06 9 -ssList(A) | duplicatefreeP(A) | ssItem(B) # label(clause72) # label(axiom). [assumption].
% 0.45/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.45/1.07 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.45/1.07 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.45/1.07 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.45/1.07 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.45/1.07 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.45/1.07 12 strictorderP(nil) # label(clause5) # label(axiom). [assumption].
% 0.45/1.07 13 -ssItem(A) | strictorderP(cons(A,nil)) # label(clause68) # label(axiom). [assumption].
% 0.45/1.07 14 -lt(skaf60(A),skaf59(A)) | -ssList(A) | strictorderP(A) # label(clause92) # label(axiom). [assumption].
% 0.45/1.07 15 -lt(skaf59(A),skaf60(A)) | -ssList(A) | strictorderP(A) # label(clause93) # label(axiom). [assumption].
% 0.45/1.07 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.45/1.07 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.45/1.07 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.45/1.07 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.45/1.07 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.45/1.07 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.45/1.07 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.45/1.07 18 totalorderP(nil) # label(clause6) # label(axiom). [assumption].
% 0.45/1.07 19 -ssItem(A) | totalorderP(cons(A,nil)) # label(clause69) # label(axiom). [assumption].
% 0.45/1.07 20 -leq(skaf55(A),skaf54(A)) | -ssList(A) | totalorderP(A) # label(clause94) # label(axiom). [assumption].
% 0.45/1.07 21 -leq(skaf54(A),skaf55(A)) | -ssList(A) | totalorderP(A) # label(clause95) # label(axiom). [assumption].
% 0.45/1.07 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.45/1.07 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.45/1.07 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.45/1.07 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.45/1.07 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)].
% 0.79/1.10 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)].
% 0.79/1.10 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].
% 0.79/1.10 24 cyclefreeP(nil) # label(clause7) # label(axiom). [assumption].
% 0.79/1.10 25 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(clause70) # label(axiom). [assumption].
% 0.79/1.10 26 -ssList(A) | cyclefreeP(A) | leq(skaf50(A),skaf49(A)) # label(clause87) # label(axiom). [assumption].
% 0.79/1.10 27 -ssList(A) | cyclefreeP(A) | leq(skaf49(A),skaf50(A)) # label(clause88) # label(axiom). [assumption].
% 0.79/1.10 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].
% 0.79/1.10 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)].
% 0.79/1.10 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)].
% 0.79/1.10 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)].
% 0.79/1.10 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)].
% 0.79/1.10 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)].
% 0.79/1.10
% 0.79/1.10 ============================== end predicate elimination =============
% 0.79/1.10
% 0.79/1.10 Auto_denials: (non-Horn, no changes).
% 0.79/1.10
% 0.79/1.10 Term ordering decisions:
% 0.79/1.10 Function symbol KB weights: nil=1. sk4=1. sk3=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.
% 0.79/1.10
% 0.79/1.10 ============================== PROOF =================================
% 0.79/1.10 % SZS status Unsatisfiable
% 0.79/1.10 % SZS output start Refutation
% 0.79/1.10
% 0.79/1.10 % Proof 1 at 0.07 (+ 0.00) seconds.
% 0.79/1.10 % Length of proof is 11.
% 0.79/1.10 % Level of proof is 3.
% 0.79/1.10 % Maximum clause weight is 6.000.
% 0.79/1.10 % Given clauses 0.
% 0.79/1.10
% 0.79/1.10 188 sk2 = sk4 # label(co1_5) # label(negated_conjecture). [assumption].
% 0.79/1.10 189 sk1 = sk3 # label(co1_6) # label(negated_conjecture). [assumption].
% 0.79/1.10 190 neq(sk2,nil) # label(co1_7) # label(negated_conjecture). [assumption].
% 0.79/1.10 191 neq(sk4,nil). [copy(190),rewrite([188(1)])].
% 0.79/1.10 194 -neq(sk1,nil) | -frontsegP(sk2,sk1) # label(co1_9) # label(negated_conjecture). [assumption].
% 0.79/1.10 195 -neq(sk3,nil) | -frontsegP(sk4,sk3). [copy(194),rewrite([189(1),188(4),189(5)])].
% 0.79/1.10 196 -neq(sk4,nil) | neq(sk3,nil) # label(co1_10) # label(negated_conjecture). [assumption].
% 0.79/1.10 197 neq(sk3,nil). [copy(196),unit_del(a,191)].
% 0.79/1.10 198 -neq(sk4,nil) | frontsegP(sk4,sk3) # label(co1_11) # label(negated_conjecture). [assumption].
% 0.79/1.10 199 frontsegP(sk4,sk3). [copy(198),unit_del(a,191)].
% 0.79/1.10 308 $F. [back_unit_del(195),unit_del(a,197),unit_del(b,199)].
% 0.79/1.10
% 0.79/1.10 % SZS output end Refutation
% 0.79/1.10 ============================== end of proof ==========================
% 0.79/1.10
% 0.79/1.10 ============================== STATISTICS ============================
% 0.79/1.10
% 0.79/1.10 Given=0. Generated=332. Kept=255. proofs=1.
% 0.79/1.10 Usable=0. Sos=160. Demods=2. Limbo=92, Disabled=222. Hints=0.
% 0.79/1.10 Megabytes=0.67.
% 0.79/1.10 User_CPU=0.07, System_CPU=0.00, Wall_clock=0.
% 0.79/1.10
% 0.79/1.10 ============================== end of statistics =====================
% 0.79/1.10
% 0.79/1.10 ============================== end of search =========================
% 0.79/1.10
% 0.79/1.10 THEOREM PROVED
% 0.79/1.10 % SZS status Unsatisfiable
% 0.79/1.10
% 0.79/1.10 Exiting with 1 proof.
% 0.79/1.10
% 0.79/1.10 Process 27453 exit (max_proofs) Sun Jun 12 21:34:38 2022
% 0.79/1.10 Prover9 interrupted
%------------------------------------------------------------------------------