TSTP Solution File: SYN010-1.005.005 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN010-1.005.005 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n007.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:15:23 EDT 2022
% Result : Unsatisfiable 0.43s 0.98s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN010-1.005.005 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n007.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.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 15:35:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 27557 was started by sandbox on n007.cluster.edu,
% 0.43/0.98 Mon Jul 11 15:35:33 2022
% 0.43/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27404_n007.cluster.edu".
% 0.43/0.98 ============================== end of head ===========================
% 0.43/0.98
% 0.43/0.98 ============================== INPUT =================================
% 0.43/0.98
% 0.43/0.98 % Reading from file /tmp/Prover9_27404_n007.cluster.edu
% 0.43/0.98
% 0.43/0.98 set(prolog_style_variables).
% 0.43/0.98 set(auto2).
% 0.43/0.98 % set(auto2) -> set(auto).
% 0.43/0.98 % set(auto) -> set(auto_inference).
% 0.43/0.98 % set(auto) -> set(auto_setup).
% 0.43/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.98 % set(auto) -> set(auto_limits).
% 0.43/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.98 % set(auto) -> set(auto_denials).
% 0.43/0.98 % set(auto) -> set(auto_process).
% 0.43/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.98 % set(auto2) -> assign(stats, some).
% 0.43/0.98 % set(auto2) -> clear(echo_input).
% 0.43/0.98 % set(auto2) -> set(quiet).
% 0.43/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.98 % set(auto2) -> clear(print_given).
% 0.43/0.98 assign(lrs_ticks,-1).
% 0.43/0.98 assign(sos_limit,10000).
% 0.43/0.98 assign(order,kbo).
% 0.43/0.98 set(lex_order_vars).
% 0.43/0.98 clear(print_given).
% 0.43/0.98
% 0.43/0.98 % formulas(sos). % not echoed (27 formulas)
% 0.43/0.98
% 0.43/0.98 ============================== end of input ==========================
% 0.43/0.98
% 0.43/0.98 % From the command line: assign(max_seconds, 300).
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.98
% 0.43/0.98 % Formulas that are not ordinary clauses:
% 0.43/0.98
% 0.43/0.98 ============================== end of process non-clausal formulas ===
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.98
% 0.43/0.98 ============================== PREDICATE ELIMINATION =================
% 0.43/0.98
% 0.43/0.98 ============================== end predicate elimination =============
% 0.43/0.98
% 0.43/0.98 Auto_denials:
% 0.43/0.98 % copying label clause_1 to answer in negative clause
% 0.43/0.98
% 0.43/0.98 Term ordering decisions:
% 0.43/0.98 Function symbol KB weights:
% 0.43/0.98
% 0.43/0.98 ============================== end of process initial clauses ========
% 0.43/0.98
% 0.43/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.98
% 0.43/0.98 ============================== end of clauses for search =============
% 0.43/0.98
% 0.43/0.98 ============================== SEARCH ================================
% 0.43/0.98
% 0.43/0.98 % Starting search at 0.01 seconds.
% 0.43/0.98
% 0.43/0.98 ============================== PROOF =================================
% 0.43/0.98 % SZS status Unsatisfiable
% 0.43/0.98 % SZS output start Refutation
% 0.43/0.98
% 0.43/0.98 % Proof 1 at 0.02 (+ 0.00) seconds: clause_1.
% 0.43/0.98 % Length of proof is 50.
% 0.43/0.98 % Level of proof is 12.
% 0.43/0.98 % Maximum clause weight is 9.000.
% 0.43/0.98 % Given clauses 47.
% 0.43/0.98
% 0.43/0.98 1 p_5_1 # label(clause_23) # label(negated_conjecture). [assumption].
% 0.43/0.98 2 p_5_2 # label(clause_24) # label(negated_conjecture). [assumption].
% 0.43/0.98 3 p_5_3 # label(clause_25) # label(negated_conjecture). [assumption].
% 0.43/0.98 4 p_5_4 # label(clause_26) # label(negated_conjecture). [assumption].
% 0.43/0.98 5 p_5_5 # label(clause_27) # label(negated_conjecture). [assumption].
% 0.43/0.98 6 -p_0 # label(clause_1) # label(negated_conjecture) # answer(clause_1). [assumption].
% 0.43/0.98 7 p_0 | -p_1_1 | -p_1_2 | -p_1_3 | -p_1_4 | -p_1_5 # label(clause_2) # label(negated_conjecture). [assumption].
% 0.43/0.98 8 p_1_1 | -p_2_1 | -p_2_2 | -p_2_3 | -p_2_4 | -p_2_5 # label(clause_3) # label(negated_conjecture). [assumption].
% 0.43/0.98 9 p_1_2 | -p_2_1 | -p_2_2 | -p_2_3 | -p_2_4 | -p_2_5 # label(clause_4) # label(negated_conjecture). [assumption].
% 0.43/0.98 10 p_1_3 | -p_2_1 | -p_2_2 | -p_2_3 | -p_2_4 | -p_2_5 # label(clause_5) # label(negated_conjecture). [assumption].
% 0.43/0.98 11 p_1_4 | -p_2_1 | -p_2_2 | -p_2_3 | -p_2_4 | -p_2_5 # label(clause_6) # label(negated_conjecture). [assumption].
% 0.43/0.98 12 p_1_5 | -p_2_1 | -p_2_2 | -p_2_3 | -p_2_4 | -p_2_5 # label(clause_7) # label(negated_conjecture). [assumption].
% 0.43/0.98 13 p_2_1 | -p_3_1 | -p_3_2 | -p_3_3 | -p_3_4 | -p_3_5 # label(clause_8) # label(negated_conjecture). [assumption].
% 0.43/0.98 14 p_2_2 | -p_3_1 | -p_3_2 | -p_3_3 | -p_3_4 | -p_3_5 # label(clause_9) # label(negated_conjecture). [assumption].
% 0.43/0.98 15 p_2_3 | -p_3_1 | -p_3_2 | -p_3_3 | -p_3_4 | -p_3_5 # label(clause_10) # label(negated_conjecture). [assumption].
% 0.43/0.98 16 p_2_4 | -p_3_1 | -p_3_2 | -p_3_3 | -p_3_4 | -p_3_5 # label(clause_11) # label(negated_conjecture). [assumption].
% 0.43/0.98 17 p_2_5 | -p_3_1 | -p_3_2 | -p_3_3 | -p_3_4 | -p_3_5 # label(clause_12) # label(negated_conjecture). [assumption].
% 0.43/0.98 18 p_3_1 | -p_4_1 | -p_4_2 | -p_4_3 | -p_4_4 | -p_4_5 # label(clause_13) # label(negated_conjecture). [assumption].
% 0.43/0.98 19 p_3_2 | -p_4_1 | -p_4_2 | -p_4_3 | -p_4_4 | -p_4_5 # label(clause_14) # label(negated_conjecture). [assumption].
% 0.43/0.98 20 p_3_3 | -p_4_1 | -p_4_2 | -p_4_3 | -p_4_4 | -p_4_5 # label(clause_15) # label(negated_conjecture). [assumption].
% 0.43/0.98 21 p_3_4 | -p_4_1 | -p_4_2 | -p_4_3 | -p_4_4 | -p_4_5 # label(clause_16) # label(negated_conjecture). [assumption].
% 0.43/0.98 22 p_3_5 | -p_4_1 | -p_4_2 | -p_4_3 | -p_4_4 | -p_4_5 # label(clause_17) # label(negated_conjecture). [assumption].
% 0.43/0.98 23 p_4_1 | -p_5_1 | -p_5_2 | -p_5_3 | -p_5_4 | -p_5_5 # label(clause_18) # label(negated_conjecture). [assumption].
% 0.43/0.98 24 p_4_2 | -p_5_1 | -p_5_2 | -p_5_3 | -p_5_4 | -p_5_5 # label(clause_19) # label(negated_conjecture). [assumption].
% 0.43/0.98 25 p_4_3 | -p_5_1 | -p_5_2 | -p_5_3 | -p_5_4 | -p_5_5 # label(clause_20) # label(negated_conjecture). [assumption].
% 0.43/0.98 26 p_4_4 | -p_5_1 | -p_5_2 | -p_5_3 | -p_5_4 | -p_5_5 # label(clause_21) # label(negated_conjecture). [assumption].
% 0.43/0.98 27 p_4_5 | -p_5_1 | -p_5_2 | -p_5_3 | -p_5_4 | -p_5_5 # label(clause_22) # label(negated_conjecture). [assumption].
% 0.43/0.98 28 -p_1_1 | -p_1_2 | -p_1_3 | -p_1_4 | -p_1_5 # answer(clause_1). [resolve(7,a,6,a)].
% 0.43/0.98 29 p_4_1. [ur(23,b,1,a,c,2,a,d,3,a,e,4,a,f,5,a)].
% 0.43/0.98 30 p_4_2. [ur(24,b,1,a,c,2,a,d,3,a,e,4,a,f,5,a)].
% 0.43/0.98 31 p_4_3. [ur(25,b,1,a,c,2,a,d,3,a,e,4,a,f,5,a)].
% 0.43/0.98 32 p_4_4. [ur(26,b,1,a,c,2,a,d,3,a,e,4,a,f,5,a)].
% 0.43/0.98 33 p_4_5. [ur(27,b,1,a,c,2,a,d,3,a,e,4,a,f,5,a)].
% 0.43/0.98 34 -p_1_2 | -p_1_3 | -p_1_4 | -p_1_5 | -p_2_1 | -p_2_2 | -p_2_3 | -p_2_4 | -p_2_5 # answer(clause_1). [resolve(28,a,8,a)].
% 0.43/0.98 39 -p_1_3 | -p_1_4 | -p_1_5 | -p_2_1 | -p_2_2 | -p_2_3 | -p_2_4 | -p_2_5 # answer(clause_1). [resolve(34,a,9,a),merge(i),merge(j),merge(k),merge(l),merge(m)].
% 0.43/0.98 48 -p_1_4 | -p_1_5 | -p_2_1 | -p_2_2 | -p_2_3 | -p_2_4 | -p_2_5 # answer(clause_1). [resolve(39,a,10,a),merge(h),merge(i),merge(j),merge(k),merge(l)].
% 0.43/0.98 56 -p_1_5 | -p_2_1 | -p_2_2 | -p_2_3 | -p_2_4 | -p_2_5 # answer(clause_1). [resolve(48,a,11,a),merge(g),merge(h),merge(i),merge(j),merge(k)].
% 0.43/0.98 63 -p_2_1 | -p_2_2 | -p_2_3 | -p_2_4 | -p_2_5 # answer(clause_1). [resolve(56,a,12,a),merge(f),merge(g),merge(h),merge(i),merge(j)].
% 0.43/0.98 69 p_3_5. [ur(22,b,29,a,c,30,a,d,31,a,e,32,a,f,33,a)].
% 0.43/0.98 70 p_3_4. [ur(21,b,29,a,c,30,a,d,31,a,e,32,a,f,33,a)].
% 0.43/0.98 71 p_3_3. [ur(20,b,29,a,c,30,a,d,31,a,e,32,a,f,33,a)].
% 0.43/0.98 72 p_3_2. [ur(19,b,29,a,c,30,a,d,31,a,e,32,a,f,33,a)].
% 0.43/0.98 73 p_3_1. [ur(18,b,29,a,c,30,a,d,31,a,e,32,a,f,33,a)].
% 0.43/0.98 74 -p_2_2 | -p_2_3 | -p_2_4 | -p_2_5 | -p_3_1 | -p_3_2 | -p_3_3 | -p_3_4 | -p_3_5 # answer(clause_1). [resolve(63,a,13,a)].
% 0.43/0.98 79 -p_2_3 | -p_2_4 | -p_2_5 | -p_3_1 | -p_3_2 | -p_3_3 | -p_3_4 | -p_3_5 # answer(clause_1). [resolve(74,a,14,a),merge(i),merge(j),merge(k),merge(l),merge(m)].
% 0.43/0.98 83 -p_2_4 | -p_2_5 | -p_3_1 | -p_3_2 | -p_3_3 | -p_3_4 | -p_3_5 # answer(clause_1). [resolve(79,a,15,a),merge(h),merge(i),merge(j),merge(k),merge(l)].
% 0.43/0.98 86 -p_2_5 | -p_3_1 | -p_3_2 | -p_3_3 | -p_3_4 | -p_3_5 # answer(clause_1). [resolve(83,a,16,a),merge(g),merge(h),merge(i),merge(j),merge(k)].
% 0.43/0.98 88 p_2_5. [ur(17,b,73,a,c,72,a,d,71,a,e,70,a,f,69,a)].
% 0.43/0.98 98 -p_2_5 # answer(clause_1). [ur(86,b,73,a,c,72,a,d,71,a,e,70,a,f,69,a)].
% 0.43/0.98 99 $F # answer(clause_1). [resolve(98,a,88,a)].
% 0.43/0.98
% 0.43/0.98 % SZS output end Refutation
% 0.43/0.98 ============================== end of proof ==========================
% 0.43/0.98
% 0.43/0.98 ============================== STATISTICS ============================
% 0.43/0.98
% 0.43/0.98 Given=47. Generated=98. Kept=98. proofs=1.
% 0.43/0.98 Usable=19. Sos=6. Demods=0. Limbo=5, Disabled=94. Hints=0.
% 0.43/0.98 Megabytes=0.09.
% 0.43/0.98 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/0.98
% 0.43/0.98 ============================== end of statistics =====================
% 0.43/0.98
% 0.43/0.98 ============================== end of search =========================
% 0.43/0.98
% 0.43/0.98 THEOREM PROVED
% 0.43/0.98 % SZS status Unsatisfiable
% 0.43/0.98
% 0.43/0.98 Exiting with 1 proof.
% 0.43/0.98
% 0.43/0.98 Process 27557 exit (max_proofs) Mon Jul 11 15:35:33 2022
% 0.43/0.98 Prover9 interrupted
%------------------------------------------------------------------------------