TSTP Solution File: SYN569-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN569-1 : TPTP v8.1.0. Released v2.5.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:21:08 EDT 2022
% Result : Unsatisfiable 0.80s 1.09s
% Output : Refutation 0.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN569-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n025.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 : Mon Jul 11 21:22:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.80/1.09 ============================== Prover9 ===============================
% 0.80/1.09 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.09 Process 2873 was started by sandbox2 on n025.cluster.edu,
% 0.80/1.09 Mon Jul 11 21:22:03 2022
% 0.80/1.09 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_2718_n025.cluster.edu".
% 0.80/1.09 ============================== end of head ===========================
% 0.80/1.09
% 0.80/1.09 ============================== INPUT =================================
% 0.80/1.09
% 0.80/1.09 % Reading from file /tmp/Prover9_2718_n025.cluster.edu
% 0.80/1.09
% 0.80/1.09 set(prolog_style_variables).
% 0.80/1.09 set(auto2).
% 0.80/1.09 % set(auto2) -> set(auto).
% 0.80/1.09 % set(auto) -> set(auto_inference).
% 0.80/1.09 % set(auto) -> set(auto_setup).
% 0.80/1.09 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.09 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.09 % set(auto) -> set(auto_limits).
% 0.80/1.09 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.09 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.09 % set(auto) -> set(auto_denials).
% 0.80/1.09 % set(auto) -> set(auto_process).
% 0.80/1.09 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.09 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.09 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.09 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.09 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.09 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.09 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.09 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.09 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.09 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.09 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.09 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.09 % set(auto2) -> assign(stats, some).
% 0.80/1.09 % set(auto2) -> clear(echo_input).
% 0.80/1.09 % set(auto2) -> set(quiet).
% 0.80/1.09 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.09 % set(auto2) -> clear(print_given).
% 0.80/1.09 assign(lrs_ticks,-1).
% 0.80/1.09 assign(sos_limit,10000).
% 0.80/1.09 assign(order,kbo).
% 0.80/1.09 set(lex_order_vars).
% 0.80/1.09 clear(print_given).
% 0.80/1.09
% 0.80/1.09 % formulas(sos). % not echoed (20 formulas)
% 0.80/1.09
% 0.80/1.09 ============================== end of input ==========================
% 0.80/1.09
% 0.80/1.09 % From the command line: assign(max_seconds, 300).
% 0.80/1.09
% 0.80/1.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.09
% 0.80/1.09 % Formulas that are not ordinary clauses:
% 0.80/1.09
% 0.80/1.09 ============================== end of process non-clausal formulas ===
% 0.80/1.09
% 0.80/1.09 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.09
% 0.80/1.09 ============================== PREDICATE ELIMINATION =================
% 0.80/1.09
% 0.80/1.09 ============================== end predicate elimination =============
% 0.80/1.09
% 0.80/1.09 Auto_denials:
% 0.80/1.09 % copying label not_p8_20 to answer in negative clause
% 0.80/1.09
% 0.80/1.09 Term ordering decisions:
% 0.80/1.09
% 0.80/1.09 % Assigning unary symbol f3 kb_weight 0 and highest precedence (14).
% 0.80/1.09 Function symbol KB weights: c11=1. c12=1. c13=1. c14=1. c15=1. f5=1. f7=1. f4=1. f3=0.
% 0.80/1.09
% 0.80/1.09 ============================== end of process initial clauses ========
% 0.80/1.09
% 0.80/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.80/1.09
% 0.80/1.09 ============================== end of clauses for search =============
% 0.80/1.09
% 0.80/1.09 ============================== SEARCH ================================
% 0.80/1.09
% 0.80/1.09 % Starting search at 0.01 seconds.
% 0.80/1.09
% 0.80/1.09 ============================== PROOF =================================
% 0.80/1.09 % SZS status Unsatisfiable
% 0.80/1.09 % SZS output start Refutation
% 0.80/1.09
% 0.80/1.09 % Proof 1 at 0.03 (+ 0.00) seconds: not_p8_20.
% 0.80/1.09 % Length of proof is 20.
% 0.80/1.09 % Level of proof is 5.
% 0.80/1.09 % Maximum clause weight is 20.000.
% 0.80/1.09 % Given clauses 47.
% 0.80/1.09
% 0.80/1.09 1 p2(A,A) # label(p2_1) # label(negated_conjecture). [assumption].
% 0.80/1.09 3 p8(c14,c12) # label(p8_3) # label(negated_conjecture). [assumption].
% 0.80/1.09 5 p8(c11,c14) # label(p8_5) # label(negated_conjecture). [assumption].
% 0.80/1.09 6 p9(c13,c15,c14) # label(p9_6) # label(negated_conjecture). [assumption].
% 0.80/1.09 7 p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)) # label(p2_15) # label(negated_conjecture). [assumption].
% 0.80/1.09 8 -p8(A,c12) | -p8(c11,A) | -p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(A))) # label(not_p8_20) # label(negated_conjecture) # answer(not_p8_20). [assumption].
% 0.80/1.09 9 p10(A,B) | -p8(A,B) # label(p10_7) # label(negated_conjecture). [assumption].
% 0.80/1.09 12 p2(A,B) | -p2(C,A) | -p2(C,B) # label(p2_10) # label(negated_conjecture). [assumption].
% 0.80/1.09 13 p2(A,B) | -p9(C,A,D) | -p9(C,B,D) # label(p2_11) # label(negated_conjecture). [assumption].
% 0.80/1.09 14 p9(c13,f3(A),A) | -p10(A,c12) | -p10(c11,A) # label(p9_12) # label(negated_conjecture). [assumption].
% 0.80/1.09 17 p2(f4(A,B),f4(C,D)) | -p2(A,C) | -p2(B,D) # label(p2_16) # label(negated_conjecture). [assumption].
% 0.80/1.09 22 -p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(c14))) # answer(not_p8_20). [resolve(8,a,3,a),unit_del(a,5)].
% 0.80/1.09 24 p10(c11,c14). [ur(9,b,5,a)].
% 0.80/1.09 26 p10(c14,c12). [ur(9,b,3,a)].
% 0.80/1.09 29 p2(f4(f5(c12,c11),c15),f5(f7(c13,c12),f7(c13,c11))). [ur(12,b,7,a,c,1,a)].
% 0.80/1.09 44 -p2(A,f5(f7(c13,c12),f7(c13,c11))) | -p2(A,f4(f5(c12,c11),f3(c14))) # answer(not_p8_20). [resolve(22,a,12,a)].
% 0.80/1.09 55 p9(c13,f3(c14),c14). [ur(14,b,26,a,c,24,a)].
% 0.80/1.09 56 p2(c15,f3(c14)). [ur(13,b,6,a,c,55,a)].
% 0.80/1.09 101 p2(f4(A,c15),f4(A,f3(c14))). [ur(17,b,1,a,c,56,a)].
% 0.80/1.09 316 $F # answer(not_p8_20). [resolve(101,a,44,b),unit_del(a,29)].
% 0.80/1.09
% 0.80/1.09 % SZS output end Refutation
% 0.80/1.09 ============================== end of proof ==========================
% 0.80/1.09
% 0.80/1.09 ============================== STATISTICS ============================
% 0.80/1.09
% 0.80/1.09 Given=47. Generated=415. Kept=315. proofs=1.
% 0.80/1.09 Usable=47. Sos=268. Demods=0. Limbo=0, Disabled=20. Hints=0.
% 0.80/1.09 Megabytes=0.37.
% 0.80/1.09 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.80/1.09
% 0.80/1.09 ============================== end of statistics =====================
% 0.80/1.09
% 0.80/1.09 ============================== end of search =========================
% 0.80/1.09
% 0.80/1.09 THEOREM PROVED
% 0.80/1.09 % SZS status Unsatisfiable
% 0.80/1.09
% 0.80/1.09 Exiting with 1 proof.
% 0.80/1.09
% 0.80/1.09 Process 2873 exit (max_proofs) Mon Jul 11 21:22:03 2022
% 0.80/1.09 Prover9 interrupted
%------------------------------------------------------------------------------