TSTP Solution File: SYN101-1.002.002 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN101-1.002.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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:16:23 EDT 2022
% Result : Unsatisfiable 0.74s 1.01s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN101-1.002.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n007.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:30:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.00 ============================== Prover9 ===============================
% 0.45/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.00 Process 11680 was started by sandbox2 on n007.cluster.edu,
% 0.45/1.00 Tue Jul 12 05:30:34 2022
% 0.45/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11527_n007.cluster.edu".
% 0.45/1.00 ============================== end of head ===========================
% 0.45/1.00
% 0.45/1.00 ============================== INPUT =================================
% 0.45/1.00
% 0.45/1.00 % Reading from file /tmp/Prover9_11527_n007.cluster.edu
% 0.45/1.00
% 0.45/1.00 set(prolog_style_variables).
% 0.45/1.00 set(auto2).
% 0.45/1.00 % set(auto2) -> set(auto).
% 0.45/1.00 % set(auto) -> set(auto_inference).
% 0.45/1.00 % set(auto) -> set(auto_setup).
% 0.45/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.00 % set(auto) -> set(auto_limits).
% 0.45/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.00 % set(auto) -> set(auto_denials).
% 0.45/1.00 % set(auto) -> set(auto_process).
% 0.45/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.00 % set(auto2) -> assign(stats, some).
% 0.45/1.00 % set(auto2) -> clear(echo_input).
% 0.45/1.00 % set(auto2) -> set(quiet).
% 0.45/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.00 % set(auto2) -> clear(print_given).
% 0.45/1.00 assign(lrs_ticks,-1).
% 0.45/1.00 assign(sos_limit,10000).
% 0.45/1.00 assign(order,kbo).
% 0.45/1.00 set(lex_order_vars).
% 0.45/1.00 clear(print_given).
% 0.45/1.00
% 0.45/1.00 % formulas(sos). % not echoed (17 formulas)
% 0.45/1.00
% 0.45/1.00 ============================== end of input ==========================
% 0.45/1.00
% 0.45/1.00 % From the command line: assign(max_seconds, 300).
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.00
% 0.45/1.00 % Formulas that are not ordinary clauses:
% 0.45/1.00
% 0.45/1.00 ============================== end of process non-clausal formulas ===
% 0.45/1.00
% 0.45/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.00
% 0.45/1.00 ============================== PREDICATE ELIMINATION =================
% 0.45/1.00 1 p_1_1(A,B) | -nq_1(A) | -nq_2(B) # label(n_t2_1) # label(axiom). [assumption].
% 0.45/1.00 2 nq_1(a) # label(n_1) # label(axiom). [assumption].
% 0.45/1.00 3 nq_1(b) # label(n_2) # label(axiom). [assumption].
% 0.45/1.00 Derived: p_1_1(a,A) | -nq_2(A). [resolve(1,b,2,a)].
% 0.45/1.00 Derived: p_1_1(b,A) | -nq_2(A). [resolve(1,b,3,a)].
% 0.45/1.00 4 q_1_1(A,B) | -nq_1(A) | -nq_2(B) # label(n_t2_2) # label(axiom). [assumption].
% 0.45/1.00 Derived: q_1_1(a,A) | -nq_2(A). [resolve(4,b,2,a)].
% 0.45/1.00 Derived: q_1_1(b,A) | -nq_2(A). [resolve(4,b,3,a)].
% 0.45/1.00 5 p_2_2(A,B) | -nq_1(A) | -nq_2(B) # label(n_t2_3) # label(axiom). [assumption].
% 0.45/1.00 Derived: p_2_2(a,A) | -nq_2(A). [resolve(5,b,2,a)].
% 0.45/1.00 Derived: p_2_2(b,A) | -nq_2(A). [resolve(5,b,3,a)].
% 0.45/1.00 6 q_2_2(A,B) | -nq_1(A) | -nq_2(B) # label(n_t2_4) # label(axiom). [assumption].
% 0.45/1.00 Derived: q_2_2(a,A) | -nq_2(A). [resolve(6,b,2,a)].
% 0.45/1.00 Derived: q_2_2(b,A) | -nq_2(A). [resolve(6,b,3,a)].
% 0.45/1.00 7 p_1_1(a,A) | -nq_2(A). [resolve(1,b,2,a)].
% 0.45/1.00 8 nq_2(a) # label(n_3) # label(axiom). [assumption].
% 0.45/1.00 9 nq_2(b) # label(n_4) # label(axiom). [assumption].
% 0.45/1.00 Derived: p_1_1(a,a). [resolve(7,b,8,a)].
% 0.45/1.00 Derived: p_1_1(a,b). [resolve(7,b,9,a)].
% 0.45/1.00 10 p_1_1(b,A) | -nq_2(A). [resolve(1,b,3,a)].
% 0.45/1.00 Derived: p_1_1(b,a). [resolve(10,b,8,a)].
% 0.45/1.00 Derived: p_1_1(b,b). [resolve(10,b,9,a)].
% 0.45/1.00 11 q_1_1(a,A) | -nq_2(A). [resolve(4,b,2,a)].
% 0.45/1.00 Derived: q_1_1(a,a). [resolve(11,b,8,a)].
% 0.45/1.00 Derived: q_1_1(a,b). [resolve(11,b,9,a)].
% 0.45/1.00 12 q_1_1(b,A) | -nq_2(A). [resolve(4,b,3,a)].
% 0.45/1.00 Derived: q_1_1(b,a). [resolve(12,b,8,a)].
% 0.45/1.00 Derived: q_1_1(b,b). [resolve(12,b,9,a)].
% 0.45/1.00 13 p_2_2(a,A) | -nq_2(A). [resolve(5,b,2,a)].
% 0.45/1.00 Derived: p_2_2(a,a). [resolve(13,b,8,a)].
% 0.45/1.00 Derived: p_2_2(a,b). [resolve(13,b,9,a)].
% 0.45/1.00 14 p_2_2(b,A) | -nq_2(A). [resolve(5,b,3,a)].
% 0.45/1.00 Derived: p_2_2(b,a). [resolve(14,b,8,a)].
% 0.45/1.00 Derived: p_2_2(b,b). [resolve(14,b,9,a)].
% 0.74/1.01 15 q_2_2(a,A) | -nq_2(A). [resolve(6,b,2,a)].
% 0.74/1.01 Derived: q_2_2(a,a). [resolve(15,b,8,a)].
% 0.74/1.01 Derived: q_2_2(a,b). [resolve(15,b,9,a)].
% 0.74/1.01 16 q_2_2(b,A) | -nq_2(A). [resolve(6,b,3,a)].
% 0.74/1.01 Derived: q_2_2(b,a). [resolve(16,b,8,a)].
% 0.74/1.01 Derived: q_2_2(b,b). [resolve(16,b,9,a)].
% 0.74/1.01 17 p_1_2(A,B) | -p_2_2(A,B) | -p_1_1(A,B) # label(n_s2_type11_1) # label(axiom). [assumption].
% 0.74/1.01 18 -p_1_2(a,a) # label(n_s2_goal_1) # label(negated_conjecture). [assumption].
% 0.74/1.01 19 p_1_1(A,B) | -p_1_2(A,B) # label(n_s2_type21_1) # label(axiom). [assumption].
% 0.74/1.01 20 p_2_2(A,B) | -p_1_2(A,B) # label(n_s2_type22_1) # label(axiom). [assumption].
% 0.74/1.01 Derived: -p_2_2(a,a) | -p_1_1(a,a). [resolve(17,a,18,a)].
% 0.74/1.01 21 p_1_2(A,B) | -q_2_2(A,B) | -q_1_1(A,B) # label(n_s2_type11_2) # label(axiom). [assumption].
% 0.74/1.01 Derived: -q_2_2(a,a) | -q_1_1(a,a). [resolve(21,a,18,a)].
% 0.74/1.01 Derived: -q_2_2(A,B) | -q_1_1(A,B) | p_1_1(A,B). [resolve(21,a,19,b)].
% 0.74/1.01 Derived: -q_2_2(A,B) | -q_1_1(A,B) | p_2_2(A,B). [resolve(21,a,20,b)].
% 0.74/1.01 22 q_1_2(A,B) | -p_2_2(A,B) | -q_1_1(A,B) # label(n_s2_type12_1) # label(axiom). [assumption].
% 0.74/1.01 23 q_1_1(A,B) | -q_1_2(A,B) # label(n_s2_type21_2) # label(axiom). [assumption].
% 0.74/1.01 24 q_1_1(a,a). [resolve(11,b,8,a)].
% 0.74/1.01 Derived: q_1_2(a,a) | -p_2_2(a,a). [resolve(24,a,22,c)].
% 0.74/1.01 25 q_1_1(a,b). [resolve(11,b,9,a)].
% 0.74/1.01 Derived: q_1_2(a,b) | -p_2_2(a,b). [resolve(25,a,22,c)].
% 0.74/1.01 26 q_1_1(b,a). [resolve(12,b,8,a)].
% 0.74/1.01 Derived: q_1_2(b,a) | -p_2_2(b,a). [resolve(26,a,22,c)].
% 0.74/1.01 27 q_1_1(b,b). [resolve(12,b,9,a)].
% 0.74/1.01 Derived: q_1_2(b,b) | -p_2_2(b,b). [resolve(27,a,22,c)].
% 0.74/1.01 28 -q_2_2(a,a) | -q_1_1(a,a). [resolve(21,a,18,a)].
% 0.74/1.01 Derived: -q_2_2(a,a) | -q_1_2(a,a). [resolve(28,b,23,a)].
% 0.74/1.01 Derived: -q_2_2(a,a). [resolve(28,b,24,a)].
% 0.74/1.01 29 -q_2_2(A,B) | -q_1_1(A,B) | p_1_1(A,B). [resolve(21,a,19,b)].
% 0.74/1.01 Derived: -q_2_2(A,B) | p_1_1(A,B) | -q_1_2(A,B). [resolve(29,b,23,a)].
% 0.74/1.01 Derived: -q_2_2(a,b) | p_1_1(a,b). [resolve(29,b,25,a)].
% 0.74/1.01 Derived: -q_2_2(b,a) | p_1_1(b,a). [resolve(29,b,26,a)].
% 0.74/1.01 Derived: -q_2_2(b,b) | p_1_1(b,b). [resolve(29,b,27,a)].
% 0.74/1.01 30 -q_2_2(A,B) | -q_1_1(A,B) | p_2_2(A,B). [resolve(21,a,20,b)].
% 0.74/1.01 Derived: -q_2_2(A,B) | p_2_2(A,B) | -q_1_2(A,B). [resolve(30,b,23,a)].
% 0.74/1.01 Derived: -q_2_2(a,b) | p_2_2(a,b). [resolve(30,b,25,a)].
% 0.74/1.01 Derived: -q_2_2(b,a) | p_2_2(b,a). [resolve(30,b,26,a)].
% 0.74/1.01 Derived: -q_2_2(b,b) | p_2_2(b,b). [resolve(30,b,27,a)].
% 0.74/1.01 31 q_1_2(A,B) | -q_2_2(A,B) | -p_1_1(A,B) # label(n_s2_type12_2) # label(axiom). [assumption].
% 0.74/1.01 32 q_2_2(A,B) | -q_1_2(A,B) # label(n_s2_type22_2) # label(axiom). [assumption].
% 0.74/1.01 33 q_2_2(a,a). [resolve(15,b,8,a)].
% 0.74/1.01 Derived: q_1_2(a,a) | -p_1_1(a,a). [resolve(33,a,31,b)].
% 0.74/1.01 34 q_2_2(a,b). [resolve(15,b,9,a)].
% 0.74/1.01 Derived: q_1_2(a,b) | -p_1_1(a,b). [resolve(34,a,31,b)].
% 0.74/1.01 35 q_2_2(b,a). [resolve(16,b,8,a)].
% 0.74/1.01 Derived: q_1_2(b,a) | -p_1_1(b,a). [resolve(35,a,31,b)].
% 0.74/1.01 36 q_2_2(b,b). [resolve(16,b,9,a)].
% 0.74/1.01 Derived: q_1_2(b,b) | -p_1_1(b,b). [resolve(36,a,31,b)].
% 0.74/1.01 37 -q_2_2(a,a) | -q_1_2(a,a). [resolve(28,b,23,a)].
% 0.74/1.01 Derived: -q_1_2(a,a) | -q_1_2(a,a). [resolve(37,a,32,a)].
% 0.74/1.01 38 -q_2_2(a,a). [resolve(28,b,24,a)].
% 0.74/1.01 Derived: $F. [resolve(38,a,33,a)].
% 0.74/1.01 39 -q_2_2(A,B) | p_1_1(A,B) | -q_1_2(A,B). [resolve(29,b,23,a)].
% 0.74/1.01 40 -q_2_2(a,b) | p_1_1(a,b). [resolve(29,b,25,a)].
% 0.74/1.01 41 -q_2_2(b,a) | p_1_1(b,a). [resolve(29,b,26,a)].
% 0.74/1.01 42 -q_2_2(b,b) | p_1_1(b,b). [resolve(29,b,27,a)].
% 0.74/1.01 43 -q_2_2(A,B) | p_2_2(A,B) | -q_1_2(A,B). [resolve(30,b,23,a)].
% 0.74/1.01 44 -q_2_2(a,b) | p_2_2(a,b). [resolve(30,b,25,a)].
% 0.74/1.01 45 -q_2_2(b,a) | p_2_2(b,a). [resolve(30,b,26,a)].
% 0.74/1.01 46 -q_2_2(b,b) | p_2_2(b,b). [resolve(30,b,27,a)].
% 0.74/1.01 47 -p_2_2(a,a) | -p_1_1(a,a). [resolve(17,a,18,a)].
% 0.74/1.01 48 p_1_1(a,a). [resolve(7,b,8,a)].
% 0.74/1.01 49 p_1_1(a,b). [resolve(7,b,9,a)].
% 0.74/1.01 50 p_1_1(b,a). [resolve(10,b,8,a)].
% 0.74/1.01 51 p_1_1(b,b). [resolve(10,b,9,a)].
% 0.74/1.01 52 q_1_2(a,a) | -p_1_1(a,a). [resolve(33,a,31,b)].
% 0.74/1.01 53 q_1_2(a,b) | -p_1_1(a,b). [resolve(34,a,31,b)].
% 0.74/1.01 54 q_1_2(b,a) | -p_1_1(b,a). [resolve(35,a,31,b)].
% 0.74/1.01 55 q_1_2(b,b) | -p_1_1(b,b). [resolve(36,a,31,b)].
% 0.74/1.01 56 q_1_2(a,a) | -p_2_2(a,a). [resolve(24,a,22,c)].
% 0.74/1.01 57 p_2_2(a,a). [resolve(13,b,8,a)].
% 0.74/1.01 58 p_2_2(a,b). [resolve(13,b,9,a)].
% 0.74/1.01 59 p_2_2(b,a). [resolve(14,b,8,a)].
% 0.74/1.01 60 p_2_2(b,b). [resolve(14,b,9,a)].
% 0.74/1.01 61 q_1_2(a,b) | -p_2_2(a,b). [resolve(25,a,22,c)].
% 0.74/1.01 62 q_1_2(b,a) | -p_2_2(b,a). [resolve(26,a,22,c)].
% 0.74/1.01 63 q_1_2(b,b) | -p_2_2(b,b). [resolve(27,a,22,c)].
% 0.74/1.01
% 0.74/1.01 ============================== end predicate elimination =============
% 0.74/1.01
% 0.74/1.01 Auto_denials:
% 0.74/1.01 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.74/1.01
% 0.74/1.01 Term ordering decisions:
% 0.74/1.01 Function symbol KB weights: a=1.
% 0.74/1.01
% 0.74/1.01 ============================== PROOF =================================
% 0.74/1.01 % SZS status Unsatisfiable
% 0.74/1.01 % SZS output start Refutation
% 0.74/1.01
% 0.74/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.74/1.01 % Length of proof is 13.
% 0.74/1.01 % Level of proof is 4.
% 0.74/1.01 % Maximum clause weight is 0.000.
% 0.74/1.01 % Given clauses 0.
% 0.74/1.01
% 0.74/1.01 2 nq_1(a) # label(n_1) # label(axiom). [assumption].
% 0.74/1.01 4 q_1_1(A,B) | -nq_1(A) | -nq_2(B) # label(n_t2_2) # label(axiom). [assumption].
% 0.74/1.01 6 q_2_2(A,B) | -nq_1(A) | -nq_2(B) # label(n_t2_4) # label(axiom). [assumption].
% 0.74/1.01 8 nq_2(a) # label(n_3) # label(axiom). [assumption].
% 0.74/1.01 11 q_1_1(a,A) | -nq_2(A). [resolve(4,b,2,a)].
% 0.74/1.01 15 q_2_2(a,A) | -nq_2(A). [resolve(6,b,2,a)].
% 0.74/1.01 18 -p_1_2(a,a) # label(n_s2_goal_1) # label(negated_conjecture). [assumption].
% 0.74/1.01 21 p_1_2(A,B) | -q_2_2(A,B) | -q_1_1(A,B) # label(n_s2_type11_2) # label(axiom). [assumption].
% 0.74/1.01 24 q_1_1(a,a). [resolve(11,b,8,a)].
% 0.74/1.01 28 -q_2_2(a,a) | -q_1_1(a,a). [resolve(21,a,18,a)].
% 0.74/1.01 33 q_2_2(a,a). [resolve(15,b,8,a)].
% 0.74/1.01 38 -q_2_2(a,a). [resolve(28,b,24,a)].
% 0.74/1.01 66 $F. [resolve(38,a,33,a)].
% 0.74/1.01
% 0.74/1.01 % SZS output end Refutation
% 0.74/1.01 ============================== end of proof ==========================
% 0.74/1.01
% 0.74/1.01 % Disable descendants (x means already disabled):
% 0.74/1.01 18x 28x 37x 38x 47x 64x 65
% 0.74/1.01
% 0.74/1.01 ============================== end of process initial clauses ========
% 0.74/1.01
% 0.74/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.01
% 0.74/1.01 ============================== end of clauses for search =============
% 0.74/1.01
% 0.74/1.01 ============================== SEARCH ================================
% 0.74/1.01
% 0.74/1.01 % Starting search at 0.01 seconds.
% 0.74/1.01
% 0.74/1.01 ============================== STATISTICS ============================
% 0.74/1.01
% 0.74/1.01 Given=0. Generated=2. Kept=1. proofs=1.
% 0.74/1.01 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=66. Hints=0.
% 0.74/1.01 Megabytes=0.04.
% 0.74/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.74/1.01
% 0.74/1.01 ============================== end of statistics =====================
% 0.74/1.01
% 0.74/1.01 ============================== end of search =========================
% 0.74/1.01
% 0.74/1.01 SEARCH FAILED
% 0.74/1.01
% 0.74/1.01 Exiting with 1 proof.
% 0.74/1.01
% 0.74/1.01 Process 11680 exit (sos_empty) Tue Jul 12 05:30:34 2022
% 0.74/1.01 Prover9 interrupted
%------------------------------------------------------------------------------