TSTP Solution File: SYN003-1.006 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN003-1.006 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:18 EDT 2022
% Result : Unsatisfiable 0.76s 1.02s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN003-1.006 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 12:35:47 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.76/1.02 ============================== Prover9 ===============================
% 0.76/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.02 Process 24970 was started by sandbox2 on n025.cluster.edu,
% 0.76/1.02 Mon Jul 11 12:35:48 2022
% 0.76/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24817_n025.cluster.edu".
% 0.76/1.02 ============================== end of head ===========================
% 0.76/1.02
% 0.76/1.02 ============================== INPUT =================================
% 0.76/1.02
% 0.76/1.02 % Reading from file /tmp/Prover9_24817_n025.cluster.edu
% 0.76/1.02
% 0.76/1.02 set(prolog_style_variables).
% 0.76/1.02 set(auto2).
% 0.76/1.02 % set(auto2) -> set(auto).
% 0.76/1.02 % set(auto) -> set(auto_inference).
% 0.76/1.02 % set(auto) -> set(auto_setup).
% 0.76/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.02 % set(auto) -> set(auto_limits).
% 0.76/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.02 % set(auto) -> set(auto_denials).
% 0.76/1.02 % set(auto) -> set(auto_process).
% 0.76/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.02 % set(auto2) -> assign(stats, some).
% 0.76/1.02 % set(auto2) -> clear(echo_input).
% 0.76/1.02 % set(auto2) -> set(quiet).
% 0.76/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.02 % set(auto2) -> clear(print_given).
% 0.76/1.02 assign(lrs_ticks,-1).
% 0.76/1.02 assign(sos_limit,10000).
% 0.76/1.02 assign(order,kbo).
% 0.76/1.02 set(lex_order_vars).
% 0.76/1.02 clear(print_given).
% 0.76/1.02
% 0.76/1.02 % formulas(sos). % not echoed (24 formulas)
% 0.76/1.02
% 0.76/1.02 ============================== end of input ==========================
% 0.76/1.02
% 0.76/1.02 % From the command line: assign(max_seconds, 300).
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.02
% 0.76/1.02 % Formulas that are not ordinary clauses:
% 0.76/1.02
% 0.76/1.02 ============================== end of process non-clausal formulas ===
% 0.76/1.02
% 0.76/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.02
% 0.76/1.02 ============================== PREDICATE ELIMINATION =================
% 0.76/1.02
% 0.76/1.02 ============================== end predicate elimination =============
% 0.76/1.02
% 0.76/1.02 Auto_denials:
% 0.76/1.02 % copying label base_2 to answer in negative clause
% 0.76/1.02
% 0.76/1.02 Term ordering decisions:
% 0.76/1.02 Function symbol KB weights:
% 0.76/1.02
% 0.76/1.02 ============================== end of process initial clauses ========
% 0.76/1.02
% 0.76/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.02
% 0.76/1.02 ============================== end of clauses for search =============
% 0.76/1.02
% 0.76/1.02 ============================== SEARCH ================================
% 0.76/1.02
% 0.76/1.02 % Starting search at 0.01 seconds.
% 0.76/1.02
% 0.76/1.02 ============================== PROOF =================================
% 0.76/1.02 % SZS status Unsatisfiable
% 0.76/1.02 % SZS output start Refutation
% 0.76/1.02
% 0.76/1.02 % Proof 1 at 0.01 (+ 0.00) seconds: base_2.
% 0.76/1.02 % Length of proof is 25.
% 0.76/1.02 % Level of proof is 6.
% 0.76/1.02 % Maximum clause weight is 3.000.
% 0.76/1.02 % Given clauses 37.
% 0.76/1.02
% 0.76/1.02 1 p_1 # label(base_1) # label(negated_conjecture). [assumption].
% 0.76/1.02 2 q # label(base_3) # label(negated_conjecture). [assumption].
% 0.76/1.02 4 -p_6 # label(base_2) # label(negated_conjecture) # answer(base_2). [assumption].
% 0.76/1.02 5 -q | q_1 # label(qq_1) # label(negated_conjecture). [assumption].
% 0.76/1.02 6 -q | q_2 # label(qq_2) # label(negated_conjecture). [assumption].
% 0.76/1.02 7 -q | q_3 # label(qq_3) # label(negated_conjecture). [assumption].
% 0.76/1.02 8 -q | q_4 # label(qq_4) # label(negated_conjecture). [assumption].
% 0.76/1.02 9 -q | q_5 # label(qq_5) # label(negated_conjecture). [assumption].
% 0.76/1.02 15 -p_1 | -q_1 | p_2 # label(pqp_1) # label(negated_conjecture). [assumption].
% 0.76/1.02 16 -p_2 | -q_2 | p_3 # label(pqp_2) # label(negated_conjecture). [assumption].
% 0.76/1.02 17 -p_3 | -q_3 | p_4 # label(pqp_3) # label(negated_conjecture). [assumption].
% 0.76/1.02 18 -p_4 | -q_4 | p_5 # label(pqp_4) # label(negated_conjecture). [assumption].
% 0.76/1.02 19 -p_5 | -q_5 | p_6 # label(pqp_5) # label(negated_conjecture). [assumption].
% 0.76/1.02 25 q_1. [ur(5,a,2,a)].
% 0.76/1.02 26 q_2. [ur(6,a,2,a)].
% 0.76/1.02 27 q_3. [ur(7,a,2,a)].
% 0.76/1.02 28 q_4. [ur(8,a,2,a)].
% 0.76/1.02 29 q_5. [ur(9,a,2,a)].
% 0.76/1.02 35 -p_5 | -q_5 # answer(base_2). [resolve(19,c,4,a)].
% 0.76/1.02 37 p_2. [ur(15,a,1,a,b,25,a)].
% 0.76/1.02 47 -p_5 # answer(base_2). [resolve(29,a,35,b)].
% 0.76/1.02 50 -p_4 # answer(base_2). [ur(18,b,28,a,c,47,a)].
% 0.76/1.02 53 -p_3 # answer(base_2). [ur(17,b,27,a,c,50,a)].
% 0.76/1.02 56 -p_2 # answer(base_2). [ur(16,b,26,a,c,53,a)].
% 0.76/1.02 57 $F # answer(base_2). [resolve(56,a,37,a)].
% 0.76/1.02
% 0.76/1.02 % SZS output end Refutation
% 0.76/1.02 ============================== end of proof ==========================
% 0.76/1.02
% 0.76/1.02 ============================== STATISTICS ============================
% 0.76/1.02
% 0.76/1.02 Given=37. Generated=57. Kept=56. proofs=1.
% 0.76/1.02 Usable=15. Sos=5. Demods=0. Limbo=2, Disabled=57. Hints=0.
% 0.76/1.02 Megabytes=0.05.
% 0.76/1.02 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.76/1.02
% 0.76/1.02 ============================== end of statistics =====================
% 0.76/1.02
% 0.76/1.02 ============================== end of search =========================
% 0.76/1.02
% 0.76/1.02 THEOREM PROVED
% 0.76/1.02 % SZS status Unsatisfiable
% 0.76/1.02
% 0.76/1.02 Exiting with 1 proof.
% 0.76/1.02
% 0.76/1.02 Process 24970 exit (max_proofs) Mon Jul 11 12:35:48 2022
% 0.76/1.02 Prover9 interrupted
%------------------------------------------------------------------------------