TSTP Solution File: LCL665+1.001 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL665+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 : Sun Jul 17 13:48:48 EDT 2022
% Result : Unknown 0.77s 1.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL665+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n021.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.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 21:45:31 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.77/1.03 ============================== Prover9 ===============================
% 0.77/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.03 Process 24004 was started by sandbox2 on n021.cluster.edu,
% 0.77/1.03 Sun Jul 3 21:45:32 2022
% 0.77/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23851_n021.cluster.edu".
% 0.77/1.03 ============================== end of head ===========================
% 0.77/1.03
% 0.77/1.03 ============================== INPUT =================================
% 0.77/1.03
% 0.77/1.03 % Reading from file /tmp/Prover9_23851_n021.cluster.edu
% 0.77/1.03
% 0.77/1.03 set(prolog_style_variables).
% 0.77/1.03 set(auto2).
% 0.77/1.03 % set(auto2) -> set(auto).
% 0.77/1.03 % set(auto) -> set(auto_inference).
% 0.77/1.03 % set(auto) -> set(auto_setup).
% 0.77/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.03 % set(auto) -> set(auto_limits).
% 0.77/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.03 % set(auto) -> set(auto_denials).
% 0.77/1.03 % set(auto) -> set(auto_process).
% 0.77/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.03 % set(auto2) -> assign(stats, some).
% 0.77/1.03 % set(auto2) -> clear(echo_input).
% 0.77/1.03 % set(auto2) -> set(quiet).
% 0.77/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.03 % set(auto2) -> clear(print_given).
% 0.77/1.03 assign(lrs_ticks,-1).
% 0.77/1.03 assign(sos_limit,10000).
% 0.77/1.03 assign(order,kbo).
% 0.77/1.03 set(lex_order_vars).
% 0.77/1.03 clear(print_given).
% 0.77/1.03
% 0.77/1.03 % formulas(sos). % not echoed (2 formulas)
% 0.77/1.03
% 0.77/1.03 ============================== end of input ==========================
% 0.77/1.03
% 0.77/1.03 % From the command line: assign(max_seconds, 300).
% 0.77/1.03
% 0.77/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.03
% 0.77/1.03 % Formulas that are not ordinary clauses:
% 0.77/1.03 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.77/1.03 2 --(exists X -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p26(X))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p25(X))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p24(X))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p22(X))))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p26(X))) & -p16(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p26(X))) & -p14(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p24(X))) & -p16(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p24(X))) & -p14(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p22(X))) & -p16(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p22(X))) & -p14(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p23(X))) & -p15(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p21(X))) & -p15(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p23(X))) & -p13(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p21(X))) & -p13(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p23(X))) & -p11(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p21(X))) & -p11(Y)))) | (all Y (-r1(X,Y) | p15(Y))) | (all Y (-r1(X,Y) | p13(Y))) | (all Y (-r1(X,Y) | p12(Y))) | (all Y (-r1(X,Y) | p11(Y))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.77/1.03
% 0.77/1.03 ============================== end of process non-clausal formulas ===
% 0.77/1.03
% 0.77/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.03
% 0.77/1.03 ============================== PREDICATE ELIMINATION =================
% 0.77/1.03 3 -r1(c1,A) | -p23(f7(A)) | p15(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 4 -p15(c2) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,c2) | -p23(f7(c2)). [resolve(3,c,4,a)].
% 0.77/1.03 5 -r1(c1,A) | -p21(f8(A)) | p15(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,c2) | -p21(f8(c2)). [resolve(5,c,4,a)].
% 0.77/1.03 6 -r1(c1,A) | r1(A,f7(A)) | p15(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,c2) | r1(c2,f7(c2)). [resolve(6,c,4,a)].
% 0.77/1.03 7 -r1(c1,A) | r1(A,f8(A)) | p15(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,c2) | r1(c2,f8(c2)). [resolve(7,c,4,a)].
% 0.77/1.03 8 -r1(c1,A) | -p23(f9(A)) | p13(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 9 -p13(c3) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,c3) | -p23(f9(c3)). [resolve(8,c,9,a)].
% 0.77/1.03 10 -r1(c1,A) | -p21(f10(A)) | p13(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,c3) | -p21(f10(c3)). [resolve(10,c,9,a)].
% 0.77/1.03 11 -r1(c1,A) | r1(A,f9(A)) | p13(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,c3) | r1(c3,f9(c3)). [resolve(11,c,9,a)].
% 0.77/1.03 12 -r1(c1,A) | r1(A,f10(A)) | p13(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,c3) | r1(c3,f10(c3)). [resolve(12,c,9,a)].
% 0.77/1.03 13 -r1(c1,A) | -p23(f11(A)) | p11(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 14 -p11(c5) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,c5) | -p23(f11(c5)). [resolve(13,c,14,a)].
% 0.77/1.03 15 -r1(c1,A) | -p21(f12(A)) | p11(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,c5) | -p21(f12(c5)). [resolve(15,c,14,a)].
% 0.77/1.03 16 -r1(c1,A) | r1(A,f11(A)) | p11(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,c5) | r1(c5,f11(c5)). [resolve(16,c,14,a)].
% 0.77/1.03 17 -r1(c1,A) | r1(A,f12(A)) | p11(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,c5) | r1(c5,f12(c5)). [resolve(17,c,14,a)].
% 0.77/1.03 18 -r1(c1,A) | -p26(f1(A)) | p16(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 19 -r1(c1,A) | -r1(A,B) | p26(B) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,A) | p16(A) | -r1(c1,B) | -r1(B,f1(A)). [resolve(18,b,19,c)].
% 0.77/1.03 20 -r1(c1,A) | -p26(f2(A)) | p14(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,A) | p14(A) | -r1(c1,B) | -r1(B,f2(A)). [resolve(20,b,19,c)].
% 0.77/1.03 21 -r1(c1,A) | -p24(f3(A)) | p16(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 22 -r1(c1,A) | -r1(A,B) | p24(B) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,A) | p16(A) | -r1(c1,B) | -r1(B,f3(A)). [resolve(21,b,22,c)].
% 0.77/1.03 23 -r1(c1,A) | -p24(f4(A)) | p14(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,A) | p14(A) | -r1(c1,B) | -r1(B,f4(A)). [resolve(23,b,22,c)].
% 0.77/1.03 24 -r1(c1,A) | -p22(f5(A)) | p16(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 25 -r1(c1,A) | -r1(A,B) | p22(B) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,A) | p16(A) | -r1(c1,B) | -r1(B,f5(A)). [resolve(24,b,25,c)].
% 0.77/1.03 26 -r1(c1,A) | -p22(f6(A)) | p14(A) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.77/1.03 Derived: -r1(c1,A) | p14(A) | -r1(c1,B) | -r1(B,f6(A)). [resolve(26,b,25,c)].
% 0.77/1.03
% 0.77/1.03 ============================== end predicate elimination =============
% 0.77/1.03
% 0.77/1.03 Auto_denials: (no changes).
% 0.77/1.03
% 0.77/1.03 Term ordering decisions:
% 0.77/1.03 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1.
% 0.77/1.03
% 0.77/1.03 ============================== end of process initial clauses ========
% 0.77/1.03
% 0.77/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.77/1.03
% 0.77/1.03 ============================== end of clauses for search =============
% 0.77/1.03
% 0.77/1.03 ============================== SEARCH ================================
% 0.77/1.03
% 0.77/1.03 % Starting search at 0.01 seconds.
% 0.77/1.03
% 0.77/1.03 ============================== STATISTICS ============================
% 0.77/1.03
% 0.77/1.03 Given=17. Generated=17. Kept=17. proofs=0.
% 0.77/1.03 Usable=11. Sos=0. Demods=0. Limbo=0, Disabled=61. Hints=0.
% 0.77/1.03 Megabytes=0.13.
% 0.77/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.77/1.03
% 0.77/1.03 ============================== end of statistics =====================
% 0.77/1.03
% 0.77/1.03 ============================== end of search =========================
% 0.77/1.03
% 0.77/1.03 SEARCH FAILED
% 0.77/1.03
% 0.77/1.03 Exiting with failure.
% 0.77/1.03
% 0.77/1.03 Process 24004 exit (sos_empty) Sun Jul 3 21:45:32 2022
% 0.77/1.03 Prover9 interrupted
%------------------------------------------------------------------------------