TSTP Solution File: SYN561-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN561-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:21:05 EDT 2022
% Result : Unsatisfiable 0.79s 1.05s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN561-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n013.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:58:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.79/1.05 ============================== Prover9 ===============================
% 0.79/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.79/1.05 Process 14315 was started by sandbox2 on n013.cluster.edu,
% 0.79/1.05 Mon Jul 11 12:58:30 2022
% 0.79/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_14162_n013.cluster.edu".
% 0.79/1.05 ============================== end of head ===========================
% 0.79/1.05
% 0.79/1.05 ============================== INPUT =================================
% 0.79/1.05
% 0.79/1.05 % Reading from file /tmp/Prover9_14162_n013.cluster.edu
% 0.79/1.05
% 0.79/1.05 set(prolog_style_variables).
% 0.79/1.05 set(auto2).
% 0.79/1.05 % set(auto2) -> set(auto).
% 0.79/1.05 % set(auto) -> set(auto_inference).
% 0.79/1.05 % set(auto) -> set(auto_setup).
% 0.79/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.79/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.79/1.05 % set(auto) -> set(auto_limits).
% 0.79/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.79/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.79/1.05 % set(auto) -> set(auto_denials).
% 0.79/1.05 % set(auto) -> set(auto_process).
% 0.79/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.79/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.79/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.79/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.79/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.79/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.79/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.79/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.79/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.79/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.79/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.79/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.79/1.05 % set(auto2) -> assign(stats, some).
% 0.79/1.05 % set(auto2) -> clear(echo_input).
% 0.79/1.05 % set(auto2) -> set(quiet).
% 0.79/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.79/1.05 % set(auto2) -> clear(print_given).
% 0.79/1.05 assign(lrs_ticks,-1).
% 0.79/1.05 assign(sos_limit,10000).
% 0.79/1.05 assign(order,kbo).
% 0.79/1.05 set(lex_order_vars).
% 0.79/1.05 clear(print_given).
% 0.79/1.05
% 0.79/1.05 % formulas(sos). % not echoed (15 formulas)
% 0.79/1.05
% 0.79/1.05 ============================== end of input ==========================
% 0.79/1.05
% 0.79/1.05 % From the command line: assign(max_seconds, 300).
% 0.79/1.05
% 0.79/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.79/1.05
% 0.79/1.05 % Formulas that are not ordinary clauses:
% 0.79/1.05
% 0.79/1.05 ============================== end of process non-clausal formulas ===
% 0.79/1.05
% 0.79/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.79/1.05
% 0.79/1.05 ============================== PREDICATE ELIMINATION =================
% 0.79/1.05
% 0.79/1.05 ============================== end predicate elimination =============
% 0.79/1.05
% 0.79/1.05 Auto_denials:
% 0.79/1.05 % copying label not_p9_15 to answer in negative clause
% 0.79/1.05
% 0.79/1.05 Term ordering decisions:
% 0.79/1.05 Function symbol KB weights: c14=1. c10=1. c11=1. c15=1. c16=1. c12=1. c13=1. f3=1. f6=1. f7=1. f4=1. f5=1.
% 0.79/1.05
% 0.79/1.05 ============================== end of process initial clauses ========
% 0.79/1.05
% 0.79/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.79/1.05
% 0.79/1.05 ============================== end of clauses for search =============
% 0.79/1.05
% 0.79/1.05 ============================== SEARCH ================================
% 0.79/1.05
% 0.79/1.05 % Starting search at 0.01 seconds.
% 0.79/1.05
% 0.79/1.05 ============================== PROOF =================================
% 0.79/1.05 % SZS status Unsatisfiable
% 0.79/1.05 % SZS output start Refutation
% 0.79/1.05
% 0.79/1.05 % Proof 1 at 0.02 (+ 0.00) seconds: not_p9_15.
% 0.79/1.05 % Length of proof is 13.
% 0.79/1.05 % Level of proof is 3.
% 0.79/1.05 % Maximum clause weight is 20.000.
% 0.79/1.05 % Given clauses 21.
% 0.79/1.05
% 0.79/1.05 1 p2(A,A) # label(p2_1) # label(negated_conjecture). [assumption].
% 0.79/1.05 2 p9(c14,c10) # label(p9_2) # label(negated_conjecture). [assumption].
% 0.79/1.05 3 p8(c11,c14) # label(p8_3) # label(negated_conjecture). [assumption].
% 0.79/1.05 4 p2(f7(c10,c14),c15) # label(p2_4) # label(negated_conjecture). [assumption].
% 0.79/1.05 5 p2(f6(c15,c11),c16) # label(p2_5) # label(negated_conjecture). [assumption].
% 0.79/1.05 6 p2(f3(f4(f5(c12)),c13),c16) # label(p2_6) # label(negated_conjecture). [assumption].
% 0.79/1.05 7 -p9(A,c10) | -p8(c11,A) | -p2(f7(c10,A),B) | -p2(f6(B,c11),f3(f4(f5(c12)),c13)) # label(not_p9_15) # label(negated_conjecture) # answer(not_p9_15). [assumption].
% 0.79/1.05 10 p2(A,B) | -p2(C,A) | -p2(C,B) # label(p2_9) # label(negated_conjecture). [assumption].
% 0.79/1.05 17 -p2(f6(c15,c11),f3(f4(f5(c12)),c13)) # answer(not_p9_15). [resolve(7,c,4,a),unit_del(a,2),unit_del(b,3)].
% 0.79/1.05 28 p2(c16,f3(f4(f5(c12)),c13)). [ur(10,b,6,a,c,1,a)].
% 0.79/1.05 29 p2(c16,f6(c15,c11)). [ur(10,b,5,a,c,1,a)].
% 0.79/1.05 83 -p2(f3(f4(f5(c12)),c13),f6(c15,c11)) # answer(not_p9_15). [ur(10,a,17,a,c,1,a)].
% 0.79/1.05 115 $F # answer(not_p9_15). [ur(10,a,83,a,c,29,a),unit_del(a,28)].
% 0.79/1.05
% 0.79/1.05 % SZS output end Refutation
% 0.79/1.05 ============================== end of proof ==========================
% 0.79/1.05
% 0.79/1.05 ============================== STATISTICS ============================
% 0.79/1.05
% 0.79/1.05 Given=21. Generated=150. Kept=114. proofs=1.
% 0.79/1.05 Usable=21. Sos=64. Demods=0. Limbo=29, Disabled=15. Hints=0.
% 0.79/1.05 Megabytes=0.13.
% 0.79/1.05 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.79/1.05
% 0.79/1.05 ============================== end of statistics =====================
% 0.79/1.05
% 0.79/1.05 ============================== end of search =========================
% 0.79/1.05
% 0.79/1.05 THEOREM PROVED
% 0.79/1.05 % SZS status Unsatisfiable
% 0.79/1.05
% 0.79/1.05 Exiting with 1 proof.
% 0.79/1.05
% 0.79/1.05 Process 14315 exit (max_proofs) Mon Jul 11 12:58:30 2022
% 0.79/1.05 Prover9 interrupted
%------------------------------------------------------------------------------