TSTP Solution File: LCL647+1.001 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL647+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:18 EDT 2022
% Result : Unknown 0.75s 1.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL647+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 15:38:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.75/1.02 ============================== Prover9 ===============================
% 0.75/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.02 Process 5419 was started by sandbox on n028.cluster.edu,
% 0.75/1.02 Mon Jul 4 15:38:35 2022
% 0.75/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5266_n028.cluster.edu".
% 0.75/1.02 ============================== end of head ===========================
% 0.75/1.02
% 0.75/1.02 ============================== INPUT =================================
% 0.75/1.02
% 0.75/1.02 % Reading from file /tmp/Prover9_5266_n028.cluster.edu
% 0.75/1.02
% 0.75/1.02 set(prolog_style_variables).
% 0.75/1.02 set(auto2).
% 0.75/1.02 % set(auto2) -> set(auto).
% 0.75/1.02 % set(auto) -> set(auto_inference).
% 0.75/1.02 % set(auto) -> set(auto_setup).
% 0.75/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.02 % set(auto) -> set(auto_limits).
% 0.75/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.02 % set(auto) -> set(auto_denials).
% 0.75/1.02 % set(auto) -> set(auto_process).
% 0.75/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.02 % set(auto2) -> assign(stats, some).
% 0.75/1.02 % set(auto2) -> clear(echo_input).
% 0.75/1.02 % set(auto2) -> set(quiet).
% 0.75/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.02 % set(auto2) -> clear(print_given).
% 0.75/1.02 assign(lrs_ticks,-1).
% 0.75/1.02 assign(sos_limit,10000).
% 0.75/1.02 assign(order,kbo).
% 0.75/1.02 set(lex_order_vars).
% 0.75/1.02 clear(print_given).
% 0.75/1.02
% 0.75/1.02 % formulas(sos). % not echoed (1 formulas)
% 0.75/1.02
% 0.75/1.02 ============================== end of input ==========================
% 0.75/1.02
% 0.75/1.02 % From the command line: assign(max_seconds, 300).
% 0.75/1.02
% 0.75/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.02
% 0.75/1.02 % Formulas that are not ordinary clauses:
% 0.75/1.02 1 --(exists X -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p6(X))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p5(X))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p4(X))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p2(X))))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p6(X))) & -p6(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p6(X))) & -p4(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p4(X))) & -p6(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p4(X))) & -p4(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p2(X))) & -p6(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p2(X))) & -p4(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p3(X))) & -p5(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p1(X))) & -p5(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p3(X))) & -p3(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p1(X))) & -p3(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p3(X))) & -p1(Y)))) | -(all Y (-r1(X,Y) | -((all X (-r1(Y,X) | p1(X))) & -p1(Y)))) | (all Y (-r1(X,Y) | p5(Y))) | (all Y (-r1(X,Y) | p3(Y))) | (all Y (-r1(X,Y) | p2(Y))) | (all Y (-r1(X,Y) | p1(Y))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.02
% 0.75/1.02 ============================== end of process non-clausal formulas ===
% 0.75/1.02
% 0.75/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.02
% 0.75/1.02 ============================== PREDICATE ELIMINATION =================
% 0.75/1.02 2 -r1(c1,A) | -r1(A,B) | p5(B) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.75/1.02 3 -p5(c2) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.75/1.02 Derived: -r1(c1,A) | -r1(A,c2). [resolve(2,c,3,a)].
% 0.75/1.02 4 -r1(c1,A) | -p3(f7(A)) | p5(A) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.75/1.02 Derived: -r1(c1,c2) | -p3(f7(c2)). [resolve(4,c,3,a)].
% 0.75/1.02 5 -r1(c1,A) | -p1(f8(A)) | p5(A) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.75/1.02 Derived: -r1(c1,c2) | -p1(f8(c2)). [resolve(5,c,3,a)].
% 0.75/1.02 6 -r1(c1,A) | r1(A,f7(A)) | p5(A) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.75/1.03 Derived: -r1(c1,c2) | r1(c2,f7(c2)). [resolve(6,c,3,a)].
% 0.75/1.03 7 -r1(c1,A) | r1(A,f8(A)) | p5(A) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.75/1.03 Derived: -r1(c1,c2) | r1(c2,f8(c2)). [resolve(7,c,3,a)].
% 0.75/1.03 8 -r1(c1,A) | -r1(A,B) | p2(B) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.75/1.03 9 -p2(c4) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.75/1.03 Derived: -r1(c1,A) | -r1(A,c4). [resolve(8,c,9,a)].
% 0.75/1.03 10 -r1(c1,A) | -p2(f5(A)) | p6(A) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.75/1.03 Derived: -r1(c1,A) | p6(A) | -r1(c1,B) | -r1(B,f5(A)). [resolve(10,b,8,c)].
% 0.75/1.03 11 -r1(c1,A) | -p2(f6(A)) | p4(A) # label(main) # label(negated_conjecture). [clausify(1)].
% 0.75/1.03 Derived: -r1(c1,A) | p4(A) | -r1(c1,B) | -r1(B,f6(A)). [resolve(11,b,8,c)].
% 0.75/1.03
% 0.75/1.03 ============================== end predicate elimination =============
% 0.75/1.03
% 0.75/1.03 Auto_denials: (non-Horn, no changes).
% 0.75/1.03
% 0.75/1.03 Term ordering decisions:
% 0.75/1.03 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1.
% 0.75/1.03
% 0.75/1.03 ============================== end of process initial clauses ========
% 0.75/1.03
% 0.75/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.03
% 0.75/1.03 ============================== end of clauses for search =============
% 0.75/1.03
% 0.75/1.03 ============================== SEARCH ================================
% 0.75/1.03
% 0.75/1.03 % Starting search at 0.02 seconds.
% 0.75/1.03
% 0.75/1.03 ============================== STATISTICS ============================
% 0.75/1.03
% 0.75/1.03 Given=169. Generated=262. Kept=195. proofs=0.
% 0.75/1.03 Usable=129. Sos=0. Demods=0. Limbo=0, Disabled=110. Hints=0.
% 0.75/1.03 Megabytes=0.26.
% 0.75/1.03 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.75/1.03
% 0.75/1.03 ============================== end of statistics =====================
% 0.75/1.03
% 0.75/1.03 ============================== end of search =========================
% 0.75/1.03
% 0.75/1.03 SEARCH FAILED
% 0.75/1.03
% 0.75/1.03 Exiting with failure.
% 0.75/1.03
% 0.75/1.03 Process 5419 exit (sos_empty) Mon Jul 4 15:38:35 2022
% 0.75/1.03 Prover9 interrupted
%------------------------------------------------------------------------------