TSTP Solution File: SYN744-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN744-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 : Thu Jul 21 11:22:17 EDT 2022
% Result : Unknown 2.03s 2.38s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN744-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n029.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.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 05:35:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.01 ============================== Prover9 ===============================
% 0.74/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.01 Process 2380 was started by sandbox2 on n029.cluster.edu,
% 0.74/1.01 Tue Jul 12 05:35:48 2022
% 0.74/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2118_n029.cluster.edu".
% 0.74/1.01 ============================== end of head ===========================
% 0.74/1.01
% 0.74/1.01 ============================== INPUT =================================
% 0.74/1.01
% 0.74/1.01 % Reading from file /tmp/Prover9_2118_n029.cluster.edu
% 0.74/1.01
% 0.74/1.01 set(prolog_style_variables).
% 0.74/1.01 set(auto2).
% 0.74/1.01 % set(auto2) -> set(auto).
% 0.74/1.01 % set(auto) -> set(auto_inference).
% 0.74/1.01 % set(auto) -> set(auto_setup).
% 0.74/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.01 % set(auto) -> set(auto_limits).
% 0.74/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.01 % set(auto) -> set(auto_denials).
% 0.74/1.01 % set(auto) -> set(auto_process).
% 0.74/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.01 % set(auto2) -> assign(stats, some).
% 0.74/1.01 % set(auto2) -> clear(echo_input).
% 0.74/1.01 % set(auto2) -> set(quiet).
% 0.74/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.01 % set(auto2) -> clear(print_given).
% 0.74/1.01 assign(lrs_ticks,-1).
% 0.74/1.01 assign(sos_limit,10000).
% 0.74/1.01 assign(order,kbo).
% 0.74/1.01 set(lex_order_vars).
% 0.74/1.01 clear(print_given).
% 0.74/1.01
% 0.74/1.01 % formulas(sos). % not echoed (31 formulas)
% 0.74/1.01
% 0.74/1.01 ============================== end of input ==========================
% 0.74/1.01
% 0.74/1.01 % From the command line: assign(max_seconds, 300).
% 0.74/1.01
% 0.74/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.01
% 0.74/1.01 % Formulas that are not ordinary clauses:
% 0.74/1.01
% 0.74/1.01 ============================== end of process non-clausal formulas ===
% 0.74/1.01
% 0.74/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.01
% 0.74/1.01 ============================== PREDICATE ELIMINATION =================
% 0.74/1.01 1 -ssRr(A,B) | -ssPv2(B) | -ssPv4(A) | -ssPv7(A) | ssPv2(A) # label(clause7) # label(negated_conjecture). [assumption].
% 0.74/1.01 2 -ssRr(A,B) | -ssPv5(B) | -ssPv3(A) | ssPv7(A) | ssPv8(A) # label(clause2) # label(negated_conjecture). [assumption].
% 0.74/1.01 3 -ssRr(A,B) | -ssPv6(B) | -ssPv3(A) | ssPv6(A) | ssPv7(A) # label(clause3) # label(negated_conjecture). [assumption].
% 0.74/1.01 4 -ssRr(A,B) | -ssPv2(B) | -ssPv5(A) | ssPv1(A) | ssPv7(A) # label(clause6) # label(negated_conjecture). [assumption].
% 0.74/1.01 Derived: -ssRr(A,B) | -ssPv2(B) | -ssPv4(A) | ssPv2(A) | -ssRr(A,C) | -ssPv5(C) | -ssPv3(A) | ssPv8(A). [resolve(1,d,2,d)].
% 0.74/1.01 Derived: -ssRr(A,B) | -ssPv2(B) | -ssPv4(A) | ssPv2(A) | -ssRr(A,C) | -ssPv6(C) | -ssPv3(A) | ssPv6(A). [resolve(1,d,3,e)].
% 0.74/1.01 Derived: -ssRr(A,B) | -ssPv2(B) | -ssPv4(A) | ssPv2(A) | -ssRr(A,C) | -ssPv2(C) | -ssPv5(A) | ssPv1(A). [resolve(1,d,4,e)].
% 0.74/1.01 5 -ssRr(A,B) | -ssRr(A,C) | -ssPv7(A) | ssPv6(B) | ssPv4(C) | ssPv6(A) # label(clause9) # label(negated_conjecture). [assumption].
% 0.74/1.01 Derived: -ssRr(A,B) | -ssRr(A,C) | ssPv6(B) | ssPv4(C) | ssPv6(A) | -ssRr(A,D) | -ssPv5(D) | -ssPv3(A) | ssPv8(A). [resolve(5,c,2,d)].
% 0.74/1.01 Derived: -ssRr(A,B) | -ssRr(A,C) | ssPv6(B) | ssPv4(C) | ssPv6(A) | -ssRr(A,D) | -ssPv6(D) | -ssPv3(A) | ssPv6(A). [resolve(5,c,3,e)].
% 0.74/1.01 Derived: -ssRr(A,B) | -ssRr(A,C) | ssPv6(B) | ssPv4(C) | ssPv6(A) | -ssRr(A,D) | -ssPv2(D) | -ssPv5(A) | ssPv1(A). [resolve(5,c,4,e)].
% 0.74/1.01 6 -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv7(A) | ssPv8(B) | ssPv4(C) | ssPv3(D) # label(clause20) # label(negated_conjecture). [assumption].
% 0.74/1.01 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv4(C) | ssPv3(D) | -ssRr(A,E) | -ssPv5(E) | -ssPv3(A) | ssPv8(A). [resolve(6,d,2,d)].
% 0.74/1.01 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv4(C) | ssPv3(D) | -ssRr(A,E) | -ssPv6(E) | -ssPv3(A) | ssPv6(A). [resolve(6,d,3,e)].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv4(C) | ssPv3(D) | -ssRr(A,E) | -ssPv2(E) | -ssPv5(A) | ssPv1(A). [resolve(6,d,4,e)].
% 2.03/2.37 7 -ssRr(A,B) | -ssPv8(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv7(C) | ssPv6(D) | ssPv4(A) # label(clause21) # label(negated_conjecture). [assumption].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssPv8(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv4(A) | -ssRr(C,E) | -ssPv2(E) | -ssPv4(C) | ssPv2(C). [resolve(7,e,1,d)].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssPv8(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv4(A) | -ssRr(C,E) | -ssRr(C,F) | ssPv6(E) | ssPv4(F) | ssPv6(C). [resolve(7,e,5,c)].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssPv8(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv4(A) | -ssRr(C,E) | -ssRr(C,F) | -ssRr(C,V6) | ssPv8(E) | ssPv4(F) | ssPv3(V6). [resolve(7,e,6,d)].
% 2.03/2.37 8 -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv4(A) | ssPv3(C) | ssPv1(D) # label(clause22) # label(negated_conjecture). [assumption].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv4(A) | ssPv3(C) | ssPv1(D) | -ssRr(B,E) | -ssPv5(E) | -ssPv3(B) | ssPv8(B). [resolve(8,b,2,d)].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv4(A) | ssPv3(C) | ssPv1(D) | -ssRr(B,E) | -ssPv6(E) | -ssPv3(B) | ssPv6(B). [resolve(8,b,3,e)].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv4(A) | ssPv3(C) | ssPv1(D) | -ssRr(B,E) | -ssPv2(E) | -ssPv5(B) | ssPv1(B). [resolve(8,b,4,e)].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv4(A) | ssPv3(C) | ssPv1(D) | -ssRr(E,F) | -ssPv8(F) | -ssRr(E,B) | -ssRr(E,V6) | ssPv6(V6) | ssPv4(E). [resolve(8,b,7,e)].
% 2.03/2.37 9 -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv1(A) | ssPv4(C) | ssPv2(D) # label(clause23) # label(negated_conjecture). [assumption].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv1(A) | ssPv4(C) | ssPv2(D) | -ssRr(B,E) | -ssPv5(E) | -ssPv3(B) | ssPv8(B). [resolve(9,b,2,d)].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv1(A) | ssPv4(C) | ssPv2(D) | -ssRr(B,E) | -ssPv6(E) | -ssPv3(B) | ssPv6(B). [resolve(9,b,3,e)].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv1(A) | ssPv4(C) | ssPv2(D) | -ssRr(B,E) | -ssPv2(E) | -ssPv5(B) | ssPv1(B). [resolve(9,b,4,e)].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv1(A) | ssPv4(C) | ssPv2(D) | -ssRr(E,F) | -ssPv8(F) | -ssRr(E,B) | -ssRr(E,V6) | ssPv6(V6) | ssPv4(E). [resolve(9,b,7,e)].
% 2.03/2.37 10 -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv1(C) | -ssRr(A,D) | -ssPv8(A) | ssPv2(D) # label(clause30) # label(negated_conjecture). [assumption].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv1(C) | -ssRr(A,D) | -ssPv8(A) | ssPv2(D) | -ssRr(B,E) | -ssPv5(E) | -ssPv3(B) | ssPv8(B). [resolve(10,b,2,d)].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv1(C) | -ssRr(A,D) | -ssPv8(A) | ssPv2(D) | -ssRr(B,E) | -ssPv6(E) | -ssPv3(B) | ssPv6(B). [resolve(10,b,3,e)].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv1(C) | -ssRr(A,D) | -ssPv8(A) | ssPv2(D) | -ssRr(B,E) | -ssPv2(E) | -ssPv5(B) | ssPv1(B). [resolve(10,b,4,e)].
% 2.03/2.37 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv1(C) | -ssRr(A,D) | -ssPv8(A) | ssPv2(D) | -ssRr(E,F) | -ssPv8(F) | -ssRr(E,B) | -ssRr(E,V6) | ssPv6(V6) | ssPv4(E). [resolve(10,b,7,e)].
% 2.03/2.37
% 2.03/2.37 ============================== end predicate elimination =============
% 2.03/2.37
% 2.03/2.37 Auto_denials: (non-Horn, no changes).
% 2.03/2.37
% 2.03/2.37 Term ordering decisions:
% 2.03/2.37
% 2.03/2.37 % Assigning unary symbol skf1 kb_weight 0 and highest precedence (9).
% 2.03/2.37 Function symbol KB weights: skf1=0.
% 2.03/2.37
% 2.03/2.37 ============================== end of process initial clauses ========
% 2.03/2.37
% 2.03/2.37 ============================== CLAUSES FOR SEARCH ====================
% 2.03/2.37
% 2.03/2.37 ============================== end of clauses for search =============
% 2.03/2.37
% 2.03/2.37 ============================== SEARCH ================================
% 2.03/2.37
% 2.03/2.37 % Starting search at 0.13 seconds.
% 2.03/2.37
% 2.03/2.37 ============================== STATISTICS ============================
% 2.03/2.37
% 2.03/2.37 Given=2419. Generated=12515. Kept=2513. proofs=0.
% 2.03/2.37 Usable=2402. Sos=0. Demods=0. Limbo=0, Disabled=166. Hints=0.
% 2.03/2.37 Megabytes=1.67.
% 2.03/2.37 User_CPU=1.36, System_CPU=0.02, Wall_clock=1.
% 2.03/2.37
% 2.03/2.37 ============================== end of statistics =====================
% 2.03/2.37
% 2.03/2.37 ============================== end of search =========================
% 2.03/2.37
% 2.03/2.37 SEARCH FAILED
% 2.03/2.37
% 2.03/2.37 Exiting with failure.
% 2.03/2.37
% 2.03/2.37 Process 2380 exit (sos_empty) Tue Jul 12 05:35:49 2022
% 2.03/2.37 Prover9 interrupted
%------------------------------------------------------------------------------