TSTP Solution File: LCL650+1.001 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL650+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:25 EDT 2022
% Result : Theorem 0.88s 1.16s
% Output : Refutation 0.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL650+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n008.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 10:35:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.73/1.04 ============================== Prover9 ===============================
% 0.73/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.04 Process 327 was started by sandbox2 on n008.cluster.edu,
% 0.73/1.04 Sun Jul 3 10:35:54 2022
% 0.73/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32640_n008.cluster.edu".
% 0.73/1.04 ============================== end of head ===========================
% 0.73/1.04
% 0.73/1.04 ============================== INPUT =================================
% 0.73/1.04
% 0.73/1.04 % Reading from file /tmp/Prover9_32640_n008.cluster.edu
% 0.73/1.04
% 0.73/1.04 set(prolog_style_variables).
% 0.73/1.04 set(auto2).
% 0.73/1.04 % set(auto2) -> set(auto).
% 0.73/1.04 % set(auto) -> set(auto_inference).
% 0.73/1.04 % set(auto) -> set(auto_setup).
% 0.73/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.04 % set(auto) -> set(auto_limits).
% 0.73/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.04 % set(auto) -> set(auto_denials).
% 0.73/1.04 % set(auto) -> set(auto_process).
% 0.73/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.04 % set(auto2) -> assign(stats, some).
% 0.73/1.04 % set(auto2) -> clear(echo_input).
% 0.73/1.04 % set(auto2) -> set(quiet).
% 0.73/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.04 % set(auto2) -> clear(print_given).
% 0.73/1.04 assign(lrs_ticks,-1).
% 0.73/1.04 assign(sos_limit,10000).
% 0.73/1.04 assign(order,kbo).
% 0.73/1.04 set(lex_order_vars).
% 0.73/1.04 clear(print_given).
% 0.73/1.04
% 0.73/1.04 % formulas(sos). % not echoed (1 formulas)
% 0.73/1.04
% 0.73/1.04 ============================== end of input ==========================
% 0.73/1.04
% 0.73/1.04 % From the command line: assign(max_seconds, 300).
% 0.73/1.04
% 0.73/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.04
% 0.73/1.04 % Formulas that are not ordinary clauses:
% 0.73/1.04 1 --(exists X -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -p8(X) & -p6(X) & -p4(X) & -p2(X))))))))) | (all Y (-r1(X,Y) | p5(Y))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-p3(X) & -p1(X) | p1(X) & p3(X)))))))) | (all X (-r1(Y,X) | p4(X))) | -(all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-p2(X) & -p3(X) | p3(X) & p2(X)))))) | (all Y (-r1(X,Y) | p3(Y))) | -(all Y (-r1(X,Y) | --(all X (-r1(Y,X) | -(-p1(X) & -p2(X) | p2(X) & p1(X)))))))))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | p4(X) & p3(X) & p2(X) & p1(X))))))))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.73/1.04
% 0.73/1.04 ============================== end of process non-clausal formulas ===
% 0.73/1.04
% 0.73/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.04
% 0.73/1.04 ============================== PREDICATE ELIMINATION =================
% 0.73/1.04 2 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p3(D) | p1(D) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.73/1.04 3 -r1(c1,A) | -r1(A,B) | -p3(f2(A,B)) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.73/1.04 4 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -p1(D) | -p3(D) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.73/1.04 5 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -p3(D) | -p2(D) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.73/1.04 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,f2(D,E)) | p1(f2(D,E)) | -r1(c1,D) | -r1(D,E). [resolve(2,e,3,c)].
% 0.73/1.04 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p1(D) | -r1(c1,E) | -r1(E,F) | -r1(F,V6) | -r1(V6,D) | -p2(D). [resolve(2,e,5,e)].
% 0.73/1.04 6 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p2(D) | p3(D) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.73/1.04 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,f2(D,E)) | p2(f2(D,E)) | -r1(c1,D) | -r1(D,E). [resolve(6,f,3,c)].
% 0.73/1.04 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p2(D) | -r1(c1,E) | -r1(E,F) | -r1(F,V6) | -r1(V6,D) | -p1(D). [resolve(6,f,4,f)].
% 0.88/1.16 7 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p1(D) | p2(D) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.88/1.16 8 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -p2(D) | -p1(D) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.88/1.16 9 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p1(D) | -r1(c1,E) | -r1(E,F) | -r1(F,V6) | -r1(V6,D) | -p2(D). [resolve(2,e,5,e)].
% 0.88/1.16 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p1(D) | -r1(c1,E) | -r1(E,F) | -r1(F,V6) | -r1(V6,D) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,D) | p1(D). [resolve(9,j,7,f)].
% 0.88/1.16 10 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,f2(D,E)) | p2(f2(D,E)) | -r1(c1,D) | -r1(D,E). [resolve(6,f,3,c)].
% 0.88/1.16 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,f2(D,E)) | -r1(c1,D) | -r1(D,E) | -r1(c1,F) | -r1(F,V6) | -r1(V6,V7) | -r1(V7,f2(D,E)) | -p1(f2(D,E)). [resolve(10,e,8,e)].
% 0.88/1.16 11 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p2(D) | -r1(c1,E) | -r1(E,F) | -r1(F,V6) | -r1(V6,D) | -p1(D). [resolve(6,f,4,f)].
% 0.88/1.16 Derived: -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(c1,E) | -r1(E,F) | -r1(F,V6) | -r1(V6,D) | -p1(D) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,D) | -p1(D). [resolve(11,e,8,e)].
% 0.88/1.16
% 0.88/1.16 ============================== end predicate elimination =============
% 0.88/1.16
% 0.88/1.16 Auto_denials: (non-Horn, no changes).
% 0.88/1.16
% 0.88/1.16 Term ordering decisions:
% 0.88/1.16
% 0.88/1.16 % Assigning unary symbol f1 kb_weight 0 and highest precedence (14).
% 0.88/1.16 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. f2=1. f1=0.
% 0.88/1.16
% 0.88/1.16 ============================== end of process initial clauses ========
% 0.88/1.16
% 0.88/1.16 ============================== CLAUSES FOR SEARCH ====================
% 0.88/1.16
% 0.88/1.16 ============================== end of clauses for search =============
% 0.88/1.16
% 0.88/1.16 ============================== SEARCH ================================
% 0.88/1.16
% 0.88/1.16 % Starting search at 0.11 seconds.
% 0.88/1.16
% 0.88/1.16 ============================== PROOF =================================
% 0.88/1.16 % SZS status Theorem
% 0.88/1.16 % SZS output start Refutation
% 0.88/1.16
% 0.88/1.16 % Proof 1 at 0.13 (+ 0.01) seconds.
% 0.88/1.16 % Length of proof is 27.
% 0.88/1.16 % Level of proof is 10.
% 0.88/1.16 % Maximum clause weight is 38.000.
% 0.88/1.16 % Given clauses 36.
% 0.88/1.16
% 0.88/1.16 1 --(exists X -((all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -p8(X) & -p6(X) & -p4(X) & -p2(X))))))))) | (all Y (-r1(X,Y) | p5(Y))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-p3(X) & -p1(X) | p1(X) & p3(X)))))))) | (all X (-r1(Y,X) | p4(X))) | -(all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-p2(X) & -p3(X) | p3(X) & p2(X)))))) | (all Y (-r1(X,Y) | p3(Y))) | -(all Y (-r1(X,Y) | --(all X (-r1(Y,X) | -(-p1(X) & -p2(X) | p2(X) & p1(X)))))))))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | p4(X) & p3(X) & p2(X) & p1(X))))))))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.88/1.16 2 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p3(D) | p1(D) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.88/1.16 4 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -p1(D) | -p3(D) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.88/1.16 5 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -p3(D) | -p2(D) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.88/1.16 6 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p2(D) | p3(D) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.88/1.16 7 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p1(D) | p2(D) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.88/1.16 8 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -p2(D) | -p1(D) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.88/1.16 9 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p1(D) | -r1(c1,E) | -r1(E,F) | -r1(F,V6) | -r1(V6,D) | -p2(D). [resolve(2,e,5,e)].
% 0.88/1.16 11 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p2(D) | -r1(c1,E) | -r1(E,F) | -r1(F,V6) | -r1(V6,D) | -p1(D). [resolve(6,f,4,f)].
% 0.88/1.16 17 r1(c1,c7) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.88/1.16 18 r1(c7,c8) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.88/1.16 19 r1(c8,c9) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.88/1.16 20 r1(c9,c10) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.88/1.16 24 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p1(D) | -r1(c1,E) | -r1(E,F) | -r1(F,V6) | -r1(V6,D) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,D) | p1(D). [resolve(9,j,7,f)].
% 0.88/1.16 25 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p1(D) | -r1(c1,E) | -r1(E,F) | -r1(F,V6) | -r1(V6,D) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,D). [copy(24),merge(n)].
% 0.88/1.16 27 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(c1,E) | -r1(E,F) | -r1(F,V6) | -r1(V6,D) | -p1(D) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,D) | -p1(D). [resolve(11,e,8,e)].
% 0.88/1.16 28 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(c1,E) | -r1(E,F) | -r1(F,V6) | -r1(V6,D) | -p1(D) | -r1(c1,V7) | -r1(V7,V8) | -r1(V8,V9) | -r1(V9,D). [copy(27),merge(n)].
% 0.88/1.16 46 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p1(D) | -r1(A,E) | -r1(E,F) | -r1(F,D) | -r1(c1,V6) | -r1(V6,V7) | -r1(V7,V8) | -r1(V8,D). [factor(25,a,f)].
% 0.88/1.16 60 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(A,E) | -r1(E,F) | -r1(F,D) | -p1(D) | -r1(c1,V6) | -r1(V6,V7) | -r1(V7,V8) | -r1(V8,D). [factor(28,a,e)].
% 0.88/1.16 89 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p1(D) | -r1(A,E) | -r1(E,F) | -r1(F,D) | -r1(A,V6) | -r1(V6,V7) | -r1(V7,D). [factor(46,a,i)].
% 0.88/1.16 123 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(A,E) | -r1(E,F) | -r1(F,D) | -p1(D) | -r1(A,V6) | -r1(V6,V7) | -r1(V7,D). [factor(60,a,i)].
% 0.88/1.16 142 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p1(D) | -r1(A,E) | -r1(E,F) | -r1(F,D). [factor(89,c,g),merge(f),merge(g)].
% 0.88/1.16 179 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -p1(D) | -r1(A,E) | -r1(E,F) | -r1(F,D). [factor(123,c,f),merge(e),merge(f)].
% 0.88/1.16 197 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p1(D). [factor(142,c,g),merge(f),merge(g)].
% 0.88/1.16 230 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -p1(D). [factor(179,c,g),merge(f),merge(g)].
% 0.88/1.16 403 -p1(c10). [ur(230,a,17,a,b,18,a,c,19,a,d,20,a)].
% 0.88/1.16 485 $F. [ur(197,b,18,a,c,19,a,d,20,a,e,403,a),unit_del(a,17)].
% 0.88/1.16
% 0.88/1.16 % SZS output end Refutation
% 0.88/1.16 ============================== end of proof ==========================
% 0.88/1.16
% 0.88/1.16 ============================== STATISTICS ============================
% 0.88/1.16
% 0.88/1.16 Given=36. Generated=3883. Kept=471. proofs=1.
% 0.88/1.16 Usable=36. Sos=222. Demods=0. Limbo=0, Disabled=242. Hints=0.
% 0.88/1.16 Megabytes=0.39.
% 0.88/1.16 User_CPU=0.13, System_CPU=0.01, Wall_clock=0.
% 0.88/1.16
% 0.88/1.16 ============================== end of statistics =====================
% 0.88/1.16
% 0.88/1.16 ============================== end of search =========================
% 0.88/1.16
% 0.88/1.16 THEOREM PROVED
% 0.88/1.16 % SZS status Theorem
% 0.88/1.16
% 0.88/1.16 Exiting with 1 proof.
% 0.88/1.16
% 0.88/1.16 Process 327 exit (max_proofs) Sun Jul 3 10:35:54 2022
% 0.88/1.16 Prover9 interrupted
%------------------------------------------------------------------------------