TSTP Solution File: LCL656+1.005 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL656+1.005 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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:34 EDT 2022
% Result : Theorem 10.04s 10.33s
% Output : Refutation 10.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL656+1.005 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Mon Jul 4 18:48:17 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.67/0.95 ============================== Prover9 ===============================
% 0.67/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.95 Process 3652 was started by sandbox on n010.cluster.edu,
% 0.67/0.95 Mon Jul 4 18:48:18 2022
% 0.67/0.95 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3499_n010.cluster.edu".
% 0.67/0.95 ============================== end of head ===========================
% 0.67/0.95
% 0.67/0.95 ============================== INPUT =================================
% 0.67/0.95
% 0.67/0.95 % Reading from file /tmp/Prover9_3499_n010.cluster.edu
% 0.67/0.95
% 0.67/0.95 set(prolog_style_variables).
% 0.67/0.95 set(auto2).
% 0.67/0.95 % set(auto2) -> set(auto).
% 0.67/0.95 % set(auto) -> set(auto_inference).
% 0.67/0.95 % set(auto) -> set(auto_setup).
% 0.67/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.95 % set(auto) -> set(auto_limits).
% 0.67/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.95 % set(auto) -> set(auto_denials).
% 0.67/0.95 % set(auto) -> set(auto_process).
% 0.67/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.95 % set(auto2) -> assign(stats, some).
% 0.67/0.95 % set(auto2) -> clear(echo_input).
% 0.67/0.95 % set(auto2) -> set(quiet).
% 0.67/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.95 % set(auto2) -> clear(print_given).
% 0.67/0.95 assign(lrs_ticks,-1).
% 0.67/0.95 assign(sos_limit,10000).
% 0.67/0.95 assign(order,kbo).
% 0.67/0.95 set(lex_order_vars).
% 0.67/0.95 clear(print_given).
% 0.67/0.95
% 0.67/0.95 % formulas(sos). % not echoed (2 formulas)
% 0.67/0.95
% 0.67/0.95 ============================== end of input ==========================
% 0.67/0.95
% 0.67/0.95 % From the command line: assign(max_seconds, 300).
% 0.67/0.95
% 0.67/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.95
% 0.67/0.95 % Formulas that are not ordinary clauses:
% 0.67/0.95 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.95 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) | p3(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) | -(-p6(X) & -p106(X) & p105(X)))) & -(all X (-r1(Y,X) | -(p6(X) & -p106(X) & p105(X)))) | -(-p105(Y) & p104(Y))) & (-(all X (-r1(Y,X) | -(-p5(X) & -p105(X) & p104(X)))) & -(all X (-r1(Y,X) | -(p5(X) & -p105(X) & p104(X)))) | -(-p104(Y) & p103(Y))) & (-(all X (-r1(Y,X) | -(-p4(X) & -p104(X) & p103(X)))) & -(all X (-r1(Y,X) | -(p4(X) & -p104(X) & p103(X)))) | -(-p103(Y) & p102(Y))) & (-(all X (-r1(Y,X) | -(-p3(X) & -p103(X) & p102(X)))) & -(all X (-r1(Y,X) | -(p3(X) & -p103(X) & p102(X)))) | -(-p102(Y) & p101(Y))) & (-(all X (-r1(Y,X) | -(-p2(X) & -p102(X) & p101(X)))) & -(all X (-r1(Y,X) | -(p2(X) & -p102(X) & p101(X)))) | -(-p101(Y) & p100(Y))) & (((all X (-r1(Y,X) | -p6(X) | -p105(X))) | p6(Y)) & ((all X (-r1(Y,X) | p6(X) | -p105(X))) | -p6(Y)) | -p105(Y)) & (((all X (-r1(Y,X) | -p5(X) | -p104(X))) | p5(Y)) & ((all X (-r1(Y,X) | p5(X) | -p104(X))) | -p5(Y)) | -p104(Y)) & (((all X (-r1(Y,X) | -p4(X) | -p103(X))) | p4(Y)) & ((all X (-r1(Y,X) | p4(X) | -p103(X))) | -p4(Y)) | -p103(Y)) & (((all X (-r1(Y,X) | -p3(X) | -p102(X))) | p3(Y)) & ((all X (-r1(Y,X) | p3(X) | -p102(X))) | -p3(Y)) | -p102(Y)) & (((all X (-r1(Y,X) | -p2(X) | -p101(X))) | p2(Y)) & ((all X (-r1(Y,X) | p2(X) | -p101(X))) | -p2(Y)) | -p101(Y)) & (((all X (-r1(Y,X) | -p1(X) | -p100(X))) | p1(Y)) & ((all X (-r1(Y,X) | p1(X) | -p100(X))) | -p1(Y)) | -p100(Y)) & (p105(Y) | -p106(Y)) & (p104(Y) | -p105(Y)) & (p103(Y) | -p104(Y)) & (p102(Y) | -p103(Y)) & (p101(Y) | -p102(Y)) & (p100(Y) | -p101(Y)))))))))))) & -p101(X) & p100(X)))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.67/0.95
% 0.67/0.95 ============================== end of process non-clausal formulas ===
% 10.04/10.33
% 10.04/10.33 ============================== PROCESS INITIAL CLAUSES ===============
% 10.04/10.33
% 10.04/10.33 ============================== PREDICATE ELIMINATION =================
% 10.04/10.33
% 10.04/10.33 ============================== end predicate elimination =============
% 10.04/10.33
% 10.04/10.33 Auto_denials: (non-Horn, no changes).
% 10.04/10.33
% 10.04/10.33 Term ordering decisions:
% 10.04/10.33 Function symbol KB weights: c1=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1.
% 10.04/10.33
% 10.04/10.33 ============================== end of process initial clauses ========
% 10.04/10.33
% 10.04/10.33 ============================== CLAUSES FOR SEARCH ====================
% 10.04/10.33
% 10.04/10.33 ============================== end of clauses for search =============
% 10.04/10.33
% 10.04/10.33 ============================== SEARCH ================================
% 10.04/10.33
% 10.04/10.33 % Starting search at 0.14 seconds.
% 10.04/10.33
% 10.04/10.33 Low Water (keep): wt=45.000, iters=3534
% 10.04/10.33
% 10.04/10.33 Low Water (keep): wt=42.000, iters=3535
% 10.04/10.33
% 10.04/10.33 Low Water (keep): wt=39.000, iters=3335
% 10.04/10.33
% 10.04/10.33 Low Water (keep): wt=38.000, iters=3335
% 10.04/10.33
% 10.04/10.33 Low Water (keep): wt=37.000, iters=3336
% 10.04/10.33
% 10.04/10.33 ============================== PROOF =================================
% 10.04/10.33 % SZS status Theorem
% 10.04/10.33 % SZS output start Refutation
% 10.04/10.33
% 10.04/10.33 % Proof 1 at 9.39 (+ 0.01) seconds.
% 10.04/10.33 % Length of proof is 29.
% 10.04/10.33 % Level of proof is 6.
% 10.04/10.33 % Maximum clause weight is 27.000.
% 10.04/10.33 % Given clauses 1072.
% 10.04/10.33
% 10.04/10.33 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption].
% 10.04/10.33 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) | p3(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) | -(-p6(X) & -p106(X) & p105(X)))) & -(all X (-r1(Y,X) | -(p6(X) & -p106(X) & p105(X)))) | -(-p105(Y) & p104(Y))) & (-(all X (-r1(Y,X) | -(-p5(X) & -p105(X) & p104(X)))) & -(all X (-r1(Y,X) | -(p5(X) & -p105(X) & p104(X)))) | -(-p104(Y) & p103(Y))) & (-(all X (-r1(Y,X) | -(-p4(X) & -p104(X) & p103(X)))) & -(all X (-r1(Y,X) | -(p4(X) & -p104(X) & p103(X)))) | -(-p103(Y) & p102(Y))) & (-(all X (-r1(Y,X) | -(-p3(X) & -p103(X) & p102(X)))) & -(all X (-r1(Y,X) | -(p3(X) & -p103(X) & p102(X)))) | -(-p102(Y) & p101(Y))) & (-(all X (-r1(Y,X) | -(-p2(X) & -p102(X) & p101(X)))) & -(all X (-r1(Y,X) | -(p2(X) & -p102(X) & p101(X)))) | -(-p101(Y) & p100(Y))) & (((all X (-r1(Y,X) | -p6(X) | -p105(X))) | p6(Y)) & ((all X (-r1(Y,X) | p6(X) | -p105(X))) | -p6(Y)) | -p105(Y)) & (((all X (-r1(Y,X) | -p5(X) | -p104(X))) | p5(Y)) & ((all X (-r1(Y,X) | p5(X) | -p104(X))) | -p5(Y)) | -p104(Y)) & (((all X (-r1(Y,X) | -p4(X) | -p103(X))) | p4(Y)) & ((all X (-r1(Y,X) | p4(X) | -p103(X))) | -p4(Y)) | -p103(Y)) & (((all X (-r1(Y,X) | -p3(X) | -p102(X))) | p3(Y)) & ((all X (-r1(Y,X) | p3(X) | -p102(X))) | -p3(Y)) | -p102(Y)) & (((all X (-r1(Y,X) | -p2(X) | -p101(X))) | p2(Y)) & ((all X (-r1(Y,X) | p2(X) | -p101(X))) | -p2(Y)) | -p101(Y)) & (((all X (-r1(Y,X) | -p1(X) | -p100(X))) | p1(Y)) & ((all X (-r1(Y,X) | p1(X) | -p100(X))) | -p1(Y)) | -p100(Y)) & (p105(Y) | -p106(Y)) & (p104(Y) | -p105(Y)) & (p103(Y) | -p104(Y)) & (p102(Y) | -p103(Y)) & (p101(Y) | -p102(Y)) & (p100(Y) | -p101(Y)))))))))))) & -p101(X) & p100(X)))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 10.04/10.33 3 p100(c1) # label(main) # label(negated_conjecture). [clausify(2)].
% 10.04/10.33 4 r1(A,A) # label(reflexivity) # label(axiom). [clausify(1)].
% 10.04/10.33 5 -p101(c1) # label(main) # label(negated_conjecture). [clausify(2)].
% 10.04/10.33 6 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | p3(E) # label(main) # label(negated_conjecture). [clausify(2)].
% 10.04/10.33 28 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -p3(f7(A,B,C,D,E)) | p102(E) | -p101(E) # label(main) # label(negated_conjecture). [clausify(2)].
% 10.04/10.33 35 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | -p102(f9(A,B,C,D,E)) | p101(E) | -p100(E) # label(main) # label(negated_conjecture). [clausify(2)].
% 10.04/10.33 36 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | p101(f9(A,B,C,D,E)) | p101(E) | -p100(E) # label(main) # label(negated_conjecture). [clausify(2)].
% 10.04/10.33 57 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | r1(E,f7(A,B,C,D,E)) | p102(E) | -p101(E) # label(main) # label(negated_conjecture). [clausify(2)].
% 10.04/10.33 59 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | -r1(D,E) | r1(E,f9(A,B,C,D,E)) | p101(E) | -p100(E) # label(main) # label(negated_conjecture). [clausify(2)].
% 10.04/10.33 250 -r1(c1,A) | -r1(A,B) | -r1(B,A) | -r1(B,C) | -p3(f7(A,B,A,B,C)) | p102(C) | -p101(C). [factor(28,b,d)].
% 10.04/10.33 315 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -p102(f9(c1,c1,A,B,C)) | p101(C) | -p100(C). [factor(35,a,b),unit_del(a,4)].
% 10.04/10.33 325 -r1(c1,A) | -r1(A,B) | -r1(B,C) | p101(f9(c1,c1,A,B,C)) | p101(C) | -p100(C). [factor(36,a,b),unit_del(a,4)].
% 10.04/10.33 502 -r1(c1,A) | -r1(A,B) | -r1(B,A) | -r1(B,C) | r1(C,f7(A,B,A,B,C)) | p102(C) | -p101(C). [factor(57,b,d)].
% 10.04/10.33 517 -r1(c1,A) | -r1(A,B) | -r1(B,C) | r1(C,f9(c1,c1,A,B,C)) | p101(C) | -p100(C). [factor(59,a,b),unit_del(a,4)].
% 10.04/10.33 829 -r1(c1,A) | -r1(A,B) | -p3(f7(A,A,A,A,B)) | p102(B) | -p101(B). [factor(250,b,c),unit_del(b,4)].
% 10.04/10.33 921 -r1(c1,A) | -r1(A,c1) | -p102(f9(c1,c1,A,c1,A)) | p101(A) | -p100(A). [factor(315,a,c)].
% 10.04/10.33 939 -r1(c1,A) | -r1(A,c1) | p101(f9(c1,c1,A,c1,A)) | p101(A) | -p100(A). [factor(325,a,c)].
% 10.04/10.33 1183 -r1(c1,A) | -r1(A,B) | r1(B,f7(A,A,A,A,B)) | p102(B) | -p101(B). [factor(502,b,c),unit_del(b,4)].
% 10.04/10.33 1201 -r1(c1,A) | -r1(A,c1) | r1(A,f9(c1,c1,A,c1,A)) | p101(A) | -p100(A). [factor(517,a,c)].
% 10.04/10.33 1252 -p102(f9(c1,c1,c1,c1,c1)). [factor(921,a,b),unit_del(a,4),unit_del(c,5),unit_del(d,3)].
% 10.04/10.33 1253 p101(f9(c1,c1,c1,c1,c1)). [factor(939,a,b),unit_del(a,4),unit_del(c,5),unit_del(d,3)].
% 10.04/10.33 1270 r1(c1,f9(c1,c1,c1,c1,c1)). [factor(1201,a,b),unit_del(a,4),unit_del(c,5),unit_del(d,3)].
% 10.04/10.33 1275 -r1(c1,A) | -r1(A,B) | -r1(B,C) | -r1(C,D) | p3(D). [resolve(6,a,4,a)].
% 10.04/10.33 1276 -r1(c1,A) | -r1(A,B) | p3(B). [factor(1275,a,b),unit_del(a,4)].
% 10.04/10.33 2598 r1(f9(c1,c1,c1,c1,c1),f7(c1,c1,c1,c1,f9(c1,c1,c1,c1,c1))). [resolve(1270,a,1183,b),unit_del(a,4),unit_del(c,1252),unit_del(d,1253)].
% 10.04/10.33 2849 -p3(f7(c1,c1,c1,c1,f9(c1,c1,c1,c1,c1))). [resolve(1270,a,829,b),unit_del(a,4),unit_del(c,1252),unit_del(d,1253)].
% 10.04/10.33 5381 $F. [ur(1276,a,1270,a,c,2849,a),unit_del(a,2598)].
% 10.04/10.33
% 10.04/10.33 % SZS output end Refutation
% 10.04/10.33 ============================== end of proof ==========================
% 10.04/10.33
% 10.04/10.33 ============================== STATISTICS ============================
% 10.04/10.33
% 10.04/10.33 Given=1072. Generated=20536. Kept=5378. proofs=1.
% 10.04/10.33 Usable=1072. Sos=3707. Demods=0. Limbo=2, Disabled=659. Hints=0.
% 10.04/10.33 Megabytes=6.38.
% 10.04/10.33 User_CPU=9.39, System_CPU=0.01, Wall_clock=9.
% 10.04/10.33
% 10.04/10.33 ============================== end of statistics =====================
% 10.04/10.33
% 10.04/10.33 ============================== end of search =========================
% 10.04/10.33
% 10.04/10.33 THEOREM PROVED
% 10.04/10.33 % SZS status Theorem
% 10.04/10.33
% 10.04/10.33 Exiting with 1 proof.
% 10.04/10.33
% 10.04/10.33 Process 3652 exit (max_proofs) Mon Jul 4 18:48:27 2022
% 10.04/10.33 Prover9 interrupted
%------------------------------------------------------------------------------