TSTP Solution File: LCL669+1.001 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL669+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:56 EDT 2022
% Result : Unknown 0.81s 1.10s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL669+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n015.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 3 02:52:45 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.43/1.02 ============================== Prover9 ===============================
% 0.43/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.02 Process 18736 was started by sandbox on n015.cluster.edu,
% 0.43/1.02 Sun Jul 3 02:52:45 2022
% 0.43/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_18581_n015.cluster.edu".
% 0.43/1.02 ============================== end of head ===========================
% 0.43/1.02
% 0.43/1.02 ============================== INPUT =================================
% 0.43/1.02
% 0.43/1.02 % Reading from file /tmp/Prover9_18581_n015.cluster.edu
% 0.43/1.02
% 0.43/1.02 set(prolog_style_variables).
% 0.43/1.02 set(auto2).
% 0.43/1.02 % set(auto2) -> set(auto).
% 0.43/1.02 % set(auto) -> set(auto_inference).
% 0.43/1.02 % set(auto) -> set(auto_setup).
% 0.43/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.02 % set(auto) -> set(auto_limits).
% 0.43/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.02 % set(auto) -> set(auto_denials).
% 0.43/1.02 % set(auto) -> set(auto_process).
% 0.43/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.02 % set(auto2) -> assign(stats, some).
% 0.43/1.02 % set(auto2) -> clear(echo_input).
% 0.43/1.02 % set(auto2) -> set(quiet).
% 0.43/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.02 % set(auto2) -> clear(print_given).
% 0.43/1.02 assign(lrs_ticks,-1).
% 0.43/1.02 assign(sos_limit,10000).
% 0.43/1.02 assign(order,kbo).
% 0.43/1.02 set(lex_order_vars).
% 0.43/1.02 clear(print_given).
% 0.43/1.02
% 0.43/1.02 % formulas(sos). % not echoed (2 formulas)
% 0.43/1.02
% 0.43/1.02 ============================== end of input ==========================
% 0.43/1.02
% 0.43/1.02 % From the command line: assign(max_seconds, 300).
% 0.43/1.02
% 0.43/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.02
% 0.43/1.02 % Formulas that are not ordinary clauses:
% 0.43/1.02 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 2 --(exists X -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -p10(Y) & -p8(Y) & -p6(Y) & -p4(Y) & -p2(Y))))))))))) | (all Y (-r1(X,Y) | p6(Y))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p4(Y) & -p1(Y) | p1(Y) & p4(Y)))))))))))))) | (all X (-r1(Y,X) | p5(X))) | -(all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p3(Y) & -p4(Y) | p4(Y) & p3(Y)))))))))))) | (all Y (-r1(X,Y) | p4(Y))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p2(Y) & -p3(Y) | p3(Y) & p2(Y)))))))))) | (all X (-r1(Y,X) | p3(X))) | -(all X (-r1(Y,X) | --(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & -p2(Y) | p2(Y) & p1(Y))))))))))))))))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | p5(Y) & p4(Y) & p3(Y) & p2(Y) & p1(Y))))))))))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.02
% 0.43/1.02 ============================== end of process non-clausal formulas ===
% 0.43/1.02
% 0.43/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.02
% 0.43/1.02 ============================== PREDICATE ELIMINATION =================
% 0.43/1.02 3 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | p4(V6) | p1(V6) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.43/1.02 4 -r1(c1,A) | -r1(A,B) | -p4(f2(A,B)) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.43/1.02 5 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | -p1(V6) | -p4(V6) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.43/1.02 6 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | -p4(V6) | -p3(V6) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.43/1.02 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f2(V6,V7)) | p1(f2(V6,V7)) | -r1(c1,V6) | -r1(V6,V7). [resolve(3,h,4,c)].
% 0.43/1.02 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | p1(V6) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V6) | -p3(V6). [resolve(3,h,6,h)].
% 0.43/1.02 7 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | p3(V6) | p4(V6) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.43/1.02 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f2(V6,V7)) | p3(f2(V6,V7)) | -r1(c1,V6) | -r1(V6,V7). [resolve(7,i,4,c)].
% 0.43/1.02 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | p3(V6) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V6) | -p1(V6). [resolve(7,i,5,i)].
% 0.43/1.02 8 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | p2(V6) | p3(V6) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.43/1.02 9 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -p3(f3(A,B,C)) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.43/1.02 10 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | -p3(V6) | -p2(V6) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.43/1.02 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f3(V6,V7,V8)) | p2(f3(V6,V7,V8)) | -r1(c1,V6) | -r1(V6,V7) | -r1(V7,V8). [resolve(8,i,9,d)].
% 0.43/1.02 11 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | p1(V6) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V6) | -p3(V6). [resolve(3,h,6,h)].
% 0.43/1.02 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | p1(V6) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V6) | -r1(c1,V13) | -r1(V13,V14) | -r1(V14,V15) | -r1(V15,V16) | -r1(V16,V17) | -r1(V17,V18) | -r1(V18,V6) | p2(V6). [resolve(11,p,8,i)].
% 0.43/1.02 12 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f2(V6,V7)) | p3(f2(V6,V7)) | -r1(c1,V6) | -r1(V6,V7). [resolve(7,i,4,c)].
% 0.43/1.02 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f2(V6,V7)) | -r1(c1,V6) | -r1(V6,V7) | -r1(c1,V8) | -r1(V8,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V13) | -r1(V13,f2(V6,V7)) | -p2(f2(V6,V7)). [resolve(12,h,10,h)].
% 0.43/1.02 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f2(V6,V7)) | -r1(c1,V6) | -r1(V6,V7) | -r1(c1,V8) | -r1(V8,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V13) | -r1(V13,f2(V6,V7)) | p1(f2(V6,V7)) | -r1(c1,V14) | -r1(V14,V15) | -r1(V15,V16) | -r1(V16,V17) | -r1(V17,V18) | -r1(V18,V19) | -r1(V19,f2(V6,V7)). [resolve(12,h,11,p)].
% 0.43/1.02 13 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | p3(V6) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V6) | -p1(V6). [resolve(7,i,5,i)].
% 0.43/1.02 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f3(V6,V7,V8)) | -r1(c1,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V13) | -r1(V13,V14) | -r1(V14,f3(V6,V7,V8)) | -p1(f3(V6,V7,V8)) | -r1(c1,V6) | -r1(V6,V7) | -r1(V7,V8). [resolve(13,h,9,d)].
% 0.43/1.02 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V6) | -p1(V6) | -r1(c1,V13) | -r1(V13,V14) | -r1(V14,V15) | -r1(V15,V16) | -r1(V16,V17) | -r1(V17,V18) | -r1(V18,V6) | -p2(V6). [resolve(13,h,10,h)].
% 0.43/1.02 14 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | p1(V6) | p2(V6) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.43/1.02 15 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | -p2(V6) | -p1(V6) # label(main) # label(negated_conjecture). [clausify(2)].
% 0.43/1.02 16 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f3(V6,V7,V8)) | p2(f3(V6,V7,V8)) | -r1(c1,V6) | -r1(V6,V7) | -r1(V7,V8). [resolve(8,i,9,d)].
% 0.81/1.10 17 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | p1(V6) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V6) | -r1(c1,V13) | -r1(V13,V14) | -r1(V14,V15) | -r1(V15,V16) | -r1(V16,V17) | -r1(V17,V18) | -r1(V18,V6) | p2(V6). [resolve(11,p,8,i)].
% 0.81/1.10 18 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f2(V6,V7)) | -r1(c1,V6) | -r1(V6,V7) | -r1(c1,V8) | -r1(V8,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V13) | -r1(V13,f2(V6,V7)) | -p2(f2(V6,V7)). [resolve(12,h,10,h)].
% 0.81/1.10 19 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,V6) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V6) | -p1(V6) | -r1(c1,V13) | -r1(V13,V14) | -r1(V14,V15) | -r1(V15,V16) | -r1(V16,V17) | -r1(V17,V18) | -r1(V18,V6) | -p2(V6). [resolve(13,h,10,h)].
% 0.81/1.10 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f3(V6,V7,V8)) | -r1(c1,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V13) | -r1(V13,V14) | -r1(V14,f3(V6,V7,V8)) | -p1(f3(V6,V7,V8)) | -r1(c1,V15) | -r1(V15,V16) | -r1(V16,V17) | -r1(V17,V18) | -r1(V18,V19) | -r1(V19,V20) | -r1(V20,f3(V6,V7,V8)) | -r1(c1,V21) | -r1(V21,V22) | -r1(V22,V23) | -r1(V23,V24) | -r1(V24,V25) | -r1(V25,V26) | -r1(V26,f3(V6,V7,V8)) | -r1(c1,V6) | -r1(V6,V7) | -r1(V7,V8). [resolve(19,w,16,h)].
% 0.81/1.10 20 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f3(V6,V7,V8)) | -r1(c1,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V13) | -r1(V13,V14) | -r1(V14,f3(V6,V7,V8)) | -p1(f3(V6,V7,V8)) | -r1(c1,V6) | -r1(V6,V7) | -r1(V7,V8). [resolve(13,h,9,d)].
% 0.81/1.10 21 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f2(V6,V7)) | p1(f2(V6,V7)) | -r1(c1,V6) | -r1(V6,V7). [resolve(3,h,4,c)].
% 0.81/1.10 22 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f2(V6,V7)) | -r1(c1,V6) | -r1(V6,V7) | -r1(c1,V8) | -r1(V8,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V13) | -r1(V13,f2(V6,V7)) | p1(f2(V6,V7)) | -r1(c1,V14) | -r1(V14,V15) | -r1(V15,V16) | -r1(V16,V17) | -r1(V17,V18) | -r1(V18,V19) | -r1(V19,f2(V6,V7)). [resolve(12,h,11,p)].
% 0.81/1.10 23 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -r1(E,F) | -r1(F,f3(V6,V7,V8)) | -r1(c1,V9) | -r1(V9,V10) | -r1(V10,V11) | -r1(V11,V12) | -r1(V12,V13) | -r1(V13,V14) | -r1(V14,f3(V6,V7,V8)) | -p1(f3(V6,V7,V8)) | -r1(c1,V15) | -r1(V15,V16) | -r1(V16,V17) | -r1(V17,V18) | -r1(V18,V19) | -r1(V19,V20) | -r1(V20,f3(V6,V7,V8)) | -r1(c1,V21) | -r1(V21,V22) | -r1(V22,V23) | -r1(V23,V24) | -r1(V24,V25) | -r1(V25,V26) | -r1(V26,f3(V6,V7,V8)) | -r1(c1,V6) | -r1(V6,V7) | -r1(V7,V8). [resolve(19,w,16,h)].
% 0.81/1.10
% 0.81/1.10 ============================== end predicate elimination =============
% 0.81/1.10
% 0.81/1.10 Auto_denials: (no changes).
% 0.81/1.10
% 0.81/1.10 Term ordering decisions:
% 0.81/1.10
% 0.81/1.10 % Assigning unary symbol f1 kb_weight 0 and highest precedence (16).
% 0.81/1.10 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. f2=1. f3=1. f1=0.
% 0.81/1.10
% 0.81/1.10 ============================== end of process initial clauses ========
% 0.81/1.10
% 0.81/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.81/1.10
% 0.81/1.10 ============================== end of clauses for search =============
% 0.81/1.10
% 0.81/1.10 ============================== SEARCH ================================
% 0.81/1.10
% 0.81/1.10 % Starting search at 0.02 seconds.
% 0.81/1.10
% 0.81/1.10 ============================== STATISTICS ============================
% 0.81/1.10
% 0.81/1.10 Given=360. Generated=360. Kept=360. proofs=0.
% 0.81/1.10 Usable=360. Sos=0. Demods=0. Limbo=0, Disabled=40. Hints=0.
% 0.81/1.10 Megabytes=0.67.
% 0.81/1.10 User_CPU=0.09, System_CPU=0.00, Wall_clock=0.
% 0.81/1.10
% 0.81/1.10 ============================== end of statistics =====================
% 0.81/1.10
% 0.81/1.10 ============================== end of search =========================
% 0.81/1.10
% 0.81/1.10 SEARCH FAILED
% 0.81/1.10
% 0.81/1.10 Exiting with failure.
% 0.81/1.10
% 0.81/1.10 Process 18736 exit (sos_empty) Sun Jul 3 02:52:45 2022
% 0.81/1.10 Prover9 interrupted
%------------------------------------------------------------------------------