TSTP Solution File: SWC329-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWC329-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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:46:42 EDT 2022
% Result : Timeout 300.06s 300.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC329-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n006.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 : Sat Jun 11 20:16:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.75/1.05 ============================== Prover9 ===============================
% 0.75/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.05 Process 27584 was started by sandbox on n006.cluster.edu,
% 0.75/1.05 Sat Jun 11 20:16:13 2022
% 0.75/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27430_n006.cluster.edu".
% 0.75/1.05 ============================== end of head ===========================
% 0.75/1.05
% 0.75/1.05 ============================== INPUT =================================
% 0.75/1.05
% 0.75/1.05 % Reading from file /tmp/Prover9_27430_n006.cluster.edu
% 0.75/1.05
% 0.75/1.05 set(prolog_style_variables).
% 0.75/1.05 set(auto2).
% 0.75/1.05 % set(auto2) -> set(auto).
% 0.75/1.05 % set(auto) -> set(auto_inference).
% 0.75/1.05 % set(auto) -> set(auto_setup).
% 0.75/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.05 % set(auto) -> set(auto_limits).
% 0.75/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.05 % set(auto) -> set(auto_denials).
% 0.75/1.05 % set(auto) -> set(auto_process).
% 0.75/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.05 % set(auto2) -> assign(stats, some).
% 0.75/1.05 % set(auto2) -> clear(echo_input).
% 0.75/1.05 % set(auto2) -> set(quiet).
% 0.75/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.05 % set(auto2) -> clear(print_given).
% 0.75/1.05 assign(lrs_ticks,-1).
% 0.75/1.05 assign(sos_limit,10000).
% 0.75/1.05 assign(order,kbo).
% 0.75/1.05 set(lex_order_vars).
% 0.75/1.05 clear(print_given).
% 0.75/1.05
% 0.75/1.05 % formulas(sos). % not echoed (200 formulas)
% 0.75/1.05
% 0.75/1.05 ============================== end of input ==========================
% 0.75/1.05
% 0.75/1.05 % From the command line: assign(max_seconds, 300).
% 0.75/1.05
% 0.75/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.05
% 0.75/1.05 % Formulas that are not ordinary clauses:
% 0.75/1.05
% 0.75/1.05 ============================== end of process non-clausal formulas ===
% 0.75/1.05
% 0.75/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.05
% 0.75/1.05 ============================== PREDICATE ELIMINATION =================
% 0.75/1.05 1 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.75/1.05 2 duplicatefreeP(nil) # label(clause2) # label(axiom). [assumption].
% 0.75/1.05 3 -ssItem(A) | duplicatefreeP(cons(A,nil)) # label(clause65) # label(axiom). [assumption].
% 0.75/1.05 4 -ssList(A) | duplicatefreeP(A) | ssItem(B) # label(clause72) # label(axiom). [assumption].
% 0.75/1.05 5 -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.75/1.05 Derived: app(app(A,cons(B,C)),cons(B,D)) != nil | -ssList(D) | -ssList(C) | -ssList(A) | -ssItem(B) | -ssList(nil). [resolve(1,f,2,a)].
% 0.75/1.05 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(1,f,3,b)].
% 0.75/1.05 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(1,f,4,b)].
% 0.75/1.05 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(1,f,5,b)].
% 0.75/1.05 6 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.75/1.05 7 strictorderP(nil) # label(clause5) # label(axiom). [assumption].
% 0.75/1.05 8 -ssItem(A) | strictorderP(cons(A,nil)) # label(clause68) # label(axiom). [assumption].
% 0.75/1.05 9 -lt(skaf60(A),skaf59(A)) | -ssList(A) | strictorderP(A) # label(clause92) # label(axiom). [assumption].
% 0.75/1.06 10 -lt(skaf59(A),skaf60(A)) | -ssList(A) | strictorderP(A) # label(clause93) # label(axiom). [assumption].
% 0.75/1.06 11 -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.75/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(6,g,7,a)].
% 0.75/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(6,g,8,b)].
% 0.75/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(6,g,9,c)].
% 0.75/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(6,g,10,c)].
% 0.75/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(6,g,11,b)].
% 0.75/1.06 12 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.75/1.06 13 totalorderP(nil) # label(clause6) # label(axiom). [assumption].
% 0.75/1.06 14 -ssItem(A) | totalorderP(cons(A,nil)) # label(clause69) # label(axiom). [assumption].
% 0.75/1.06 15 -leq(skaf55(A),skaf54(A)) | -ssList(A) | totalorderP(A) # label(clause94) # label(axiom). [assumption].
% 0.75/1.06 16 -leq(skaf54(A),skaf55(A)) | -ssList(A) | totalorderP(A) # label(clause95) # label(axiom). [assumption].
% 0.75/1.06 17 -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.75/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(12,g,13,a)].
% 0.75/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(12,g,14,b)].
% 0.75/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(12,g,15,c)].
% 0.75/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(12,g,16,c)].
% 0.75/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) | -ssList(F) | app(app(skaf56(F),cons(skaf54(F),skaf57(F))),cons(skaf55(F),skaf58(F))) = F. [resolve(12,g,17,b)].
% 0.75/1.06 18 -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.75/1.06 19 cyclefreeP(nil) # label(clause7) # label(axiom). [assumption].
% 0.75/1.06 20 -ssItem(A) | cyclefreeP(cons(A,nil)) # label(clause70) # label(axiom). [assumption].
% 0.75/1.06 21 -ssList(A) | cyclefreeP(A) | leq(skaf50(A),skaf49(A)) # label(clause87) # label(axiom). [assumption].
% 0.75/1.06 22 -ssList(A) | cyclefreeP(A) | leq(skaf49(A),skaf50(A)) # label(clause88) # label(axiom). [assumption].
% 0.75/1.06 23 -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.75/1.06 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(18,i,19,a)].
% 0.75/1.06 Derived: -leq(A,B) | -leq(B,A) | app(app(C,cons(A,D)),cons(B,E)) != cons(Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------