TSTP Solution File: SYN686-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN686-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:52 EDT 2022
% Result : Unsatisfiable 0.73s 1.04s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN686-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n013.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:17:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.04 ============================== Prover9 ===============================
% 0.73/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.04 Process 26969 was started by sandbox2 on n013.cluster.edu,
% 0.73/1.04 Tue Jul 12 05:18:00 2022
% 0.73/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26816_n013.cluster.edu".
% 0.73/1.04 ============================== end of head ===========================
% 0.73/1.04
% 0.73/1.04 ============================== INPUT =================================
% 0.73/1.04
% 0.73/1.04 % Reading from file /tmp/Prover9_26816_n013.cluster.edu
% 0.73/1.04
% 0.73/1.04 set(prolog_style_variables).
% 0.73/1.04 set(auto2).
% 0.73/1.04 % set(auto2) -> set(auto).
% 0.73/1.04 % set(auto) -> set(auto_inference).
% 0.73/1.04 % set(auto) -> set(auto_setup).
% 0.73/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.04 % set(auto) -> set(auto_limits).
% 0.73/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.04 % set(auto) -> set(auto_denials).
% 0.73/1.04 % set(auto) -> set(auto_process).
% 0.73/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.04 % set(auto2) -> assign(stats, some).
% 0.73/1.04 % set(auto2) -> clear(echo_input).
% 0.73/1.04 % set(auto2) -> set(quiet).
% 0.73/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.04 % set(auto2) -> clear(print_given).
% 0.73/1.04 assign(lrs_ticks,-1).
% 0.73/1.04 assign(sos_limit,10000).
% 0.73/1.04 assign(order,kbo).
% 0.73/1.04 set(lex_order_vars).
% 0.73/1.04 clear(print_given).
% 0.73/1.04
% 0.73/1.04 % formulas(sos). % not echoed (58 formulas)
% 0.73/1.04
% 0.73/1.04 ============================== end of input ==========================
% 0.73/1.04
% 0.73/1.04 % From the command line: assign(max_seconds, 300).
% 0.73/1.04
% 0.73/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.04
% 0.73/1.04 % Formulas that are not ordinary clauses:
% 0.73/1.04
% 0.73/1.04 ============================== end of process non-clausal formulas ===
% 0.73/1.04
% 0.73/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.04
% 0.73/1.04 ============================== PREDICATE ELIMINATION =================
% 0.73/1.04
% 0.73/1.04 ============================== end predicate elimination =============
% 0.73/1.04
% 0.73/1.04 Auto_denials: (non-Horn, no changes).
% 0.73/1.04
% 0.73/1.04 Term ordering decisions:
% 0.73/1.04 Function symbol KB weights: c36=1. c39=1. c33=1. c34=1. c43=1. c32=1. c44=1. c45=1. c38=1. c40=1. c37=1. c35=1. c41=1. c42=1. f5=1. f10=1. f7=1. f23=1. f25=1. f12=1. f17=1. f19=1. f21=1. f27=1. f29=1. f15=1.
% 0.73/1.04
% 0.73/1.04 ============================== end of process initial clauses ========
% 0.73/1.04
% 0.73/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.04
% 0.73/1.04 ============================== end of clauses for search =============
% 0.73/1.04
% 0.73/1.04 ============================== SEARCH ================================
% 0.73/1.04
% 0.73/1.04 % Starting search at 0.02 seconds.
% 0.73/1.04
% 0.73/1.04 ============================== PROOF =================================
% 0.73/1.04 % SZS status Unsatisfiable
% 0.73/1.04 % SZS output start Refutation
% 0.73/1.04
% 0.73/1.04 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.73/1.04 % Length of proof is 32.
% 0.73/1.04 % Level of proof is 5.
% 0.73/1.04 % Maximum clause weight is 15.000.
% 0.73/1.04 % Given clauses 156.
% 0.73/1.04
% 0.73/1.04 1 p11(A,A) # label(p11_1) # label(negated_conjecture). [assumption].
% 0.73/1.04 2 p9(A,A) # label(p9_2) # label(negated_conjecture). [assumption].
% 0.73/1.04 3 p8(A,A) # label(p8_3) # label(negated_conjecture). [assumption].
% 0.73/1.04 5 p4(A,A) # label(p4_5) # label(negated_conjecture). [assumption].
% 0.73/1.04 6 p3(A,A) # label(p3_6) # label(negated_conjecture). [assumption].
% 0.73/1.04 12 p2(A,A) # label(p2_12) # label(negated_conjecture). [assumption].
% 0.73/1.04 17 p3(c36,f7(c33,c34)) # label(p3_17) # label(negated_conjecture). [assumption].
% 0.73/1.04 19 p4(f5(c32,c36),c37) # label(p4_19) # label(negated_conjecture). [assumption].
% 0.73/1.04 20 p4(f5(c32,f7(c33,c34)),c35) # label(p4_20) # label(negated_conjecture). [assumption].
% 0.73/1.04 21 p30(f10(f12(c39,c36),c37),c41) # label(p30_21) # label(negated_conjecture). [assumption].
% 0.73/1.04 22 -p30(f10(f12(c39,f7(c33,c34)),c35),c41) # label(not_p30_22) # label(negated_conjecture). [assumption].
% 0.73/1.04 24 p9(A,B) | -p9(C,A) | -p9(C,B) # label(p9_24) # label(negated_conjecture). [assumption].
% 0.73/1.04 27 p4(A,B) | -p4(C,A) | -p4(C,B) # label(p4_27) # label(negated_conjecture). [assumption].
% 0.73/1.04 28 p3(A,B) | -p3(C,A) | -p3(C,B) # label(p3_28) # label(negated_conjecture). [assumption].
% 0.73/1.04 39 p30(A,B) | -p4(C,B) | -p9(D,A) | -p30(D,C) # label(p30_39) # label(negated_conjecture). [assumption].
% 0.73/1.04 41 p9(f10(A,B),f10(C,D)) | -p4(B,D) | -p8(A,C) # label(p9_41) # label(negated_conjecture). [assumption].
% 0.73/1.04 50 p4(f5(A,B),f5(C,D)) | -p2(A,C) | -p3(B,D) # label(p4_50) # label(negated_conjecture). [assumption].
% 0.73/1.04 51 p8(f12(A,B),f12(C,D)) | -p11(A,C) | -p3(B,D) # label(p8_51) # label(negated_conjecture). [assumption].
% 0.73/1.04 65 p4(A,c35) | -p4(f5(c32,f7(c33,c34)),A). [resolve(27,c,20,a)].
% 0.73/1.04 72 p3(A,B) | -p3(B,A). [resolve(28,c,6,a)].
% 0.73/1.04 84 -p9(f10(f12(c39,c36),c37),f10(f12(c39,f7(c33,c34)),c35)). [ur(39,a,22,a,b,5,a,d,21,a)].
% 0.73/1.04 85 p9(f10(A,B),f10(A,C)) | -p4(B,C). [resolve(41,c,3,a)].
% 0.73/1.04 94 p4(f5(A,B),f5(A,C)) | -p3(B,C). [resolve(50,b,12,a)].
% 0.73/1.04 95 p8(f12(A,B),f12(A,C)) | -p3(B,C). [resolve(51,b,1,a)].
% 0.73/1.04 101 -p9(f10(f12(c39,f7(c33,c34)),c35),f10(f12(c39,c36),c37)). [ur(24,a,84,a,c,2,a)].
% 0.73/1.04 107 p3(f7(c33,c34),c36). [resolve(72,b,17,a)].
% 0.73/1.04 124 p9(f10(A,f5(c32,c36)),f10(A,c37)). [resolve(85,b,19,a)].
% 0.73/1.04 145 -p9(f10(f12(c39,c36),f5(c32,c36)),f10(f12(c39,f7(c33,c34)),c35)). [ur(24,a,101,a,c,124,a)].
% 0.73/1.04 243 p4(f5(A,f7(c33,c34)),f5(A,c36)). [resolve(94,b,107,a)].
% 0.73/1.04 286 p8(f12(A,c36),f12(A,f7(c33,c34))). [resolve(95,b,17,a)].
% 0.73/1.04 322 p4(f5(c32,c36),c35). [resolve(243,a,65,b)].
% 0.73/1.04 337 $F. [ur(41,a,145,a,b,322,a),unit_del(a,286)].
% 0.73/1.04
% 0.73/1.04 % SZS output end Refutation
% 0.73/1.04 ============================== end of proof ==========================
% 0.73/1.04
% 0.73/1.04 ============================== STATISTICS ============================
% 0.73/1.04
% 0.73/1.04 Given=156. Generated=514. Kept=336. proofs=1.
% 0.73/1.04 Usable=156. Sos=170. Demods=0. Limbo=10, Disabled=58. Hints=0.
% 0.73/1.04 Megabytes=0.49.
% 0.73/1.04 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.73/1.04
% 0.73/1.04 ============================== end of statistics =====================
% 0.73/1.04
% 0.73/1.04 ============================== end of search =========================
% 0.73/1.04
% 0.73/1.04 THEOREM PROVED
% 0.73/1.04 % SZS status Unsatisfiable
% 0.73/1.04
% 0.73/1.04 Exiting with 1 proof.
% 0.73/1.04
% 0.73/1.04 Process 26969 exit (max_proofs) Tue Jul 12 05:18:00 2022
% 0.73/1.04 Prover9 interrupted
%------------------------------------------------------------------------------