TSTP Solution File: SYN580-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN580-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:12 EDT 2022
% Result : Unsatisfiable 0.42s 0.99s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN580-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 05:44:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.99 ============================== Prover9 ===============================
% 0.42/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99 Process 27657 was started by sandbox2 on n022.cluster.edu,
% 0.42/0.99 Tue Jul 12 05:44:40 2022
% 0.42/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27504_n022.cluster.edu".
% 0.42/0.99 ============================== end of head ===========================
% 0.42/0.99
% 0.42/0.99 ============================== INPUT =================================
% 0.42/0.99
% 0.42/0.99 % Reading from file /tmp/Prover9_27504_n022.cluster.edu
% 0.42/0.99
% 0.42/0.99 set(prolog_style_variables).
% 0.42/0.99 set(auto2).
% 0.42/0.99 % set(auto2) -> set(auto).
% 0.42/0.99 % set(auto) -> set(auto_inference).
% 0.42/0.99 % set(auto) -> set(auto_setup).
% 0.42/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.99 % set(auto) -> set(auto_limits).
% 0.42/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.99 % set(auto) -> set(auto_denials).
% 0.42/0.99 % set(auto) -> set(auto_process).
% 0.42/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.99 % set(auto2) -> assign(stats, some).
% 0.42/0.99 % set(auto2) -> clear(echo_input).
% 0.42/0.99 % set(auto2) -> set(quiet).
% 0.42/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.99 % set(auto2) -> clear(print_given).
% 0.42/0.99 assign(lrs_ticks,-1).
% 0.42/0.99 assign(sos_limit,10000).
% 0.42/0.99 assign(order,kbo).
% 0.42/0.99 set(lex_order_vars).
% 0.42/0.99 clear(print_given).
% 0.42/0.99
% 0.42/0.99 % formulas(sos). % not echoed (23 formulas)
% 0.42/0.99
% 0.42/0.99 ============================== end of input ==========================
% 0.42/0.99
% 0.42/0.99 % From the command line: assign(max_seconds, 300).
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.99
% 0.42/0.99 % Formulas that are not ordinary clauses:
% 0.42/0.99
% 0.42/0.99 ============================== end of process non-clausal formulas ===
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.99
% 0.42/0.99 ============================== PREDICATE ELIMINATION =================
% 0.42/0.99
% 0.42/0.99 ============================== end predicate elimination =============
% 0.42/0.99
% 0.42/0.99 Auto_denials: (non-Horn, no changes).
% 0.42/0.99
% 0.42/0.99 Term ordering decisions:
% 0.42/0.99 Function symbol KB weights: c12=1. c15=1. c16=1. c13=1. c14=1. f3=1. f5=1. f6=1.
% 0.42/0.99
% 0.42/0.99 ============================== end of process initial clauses ========
% 0.42/0.99
% 0.42/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.99
% 0.42/0.99 ============================== end of clauses for search =============
% 0.42/0.99
% 0.42/0.99 ============================== SEARCH ================================
% 0.42/0.99
% 0.42/0.99 % Starting search at 0.01 seconds.
% 0.42/0.99
% 0.42/0.99 ============================== PROOF =================================
% 0.42/0.99 % SZS status Unsatisfiable
% 0.42/0.99 % SZS output start Refutation
% 0.42/0.99
% 0.42/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.42/0.99 % Length of proof is 19.
% 0.42/0.99 % Level of proof is 6.
% 0.42/0.99 % Maximum clause weight is 17.000.
% 0.42/0.99 % Given clauses 49.
% 0.42/0.99
% 0.42/0.99 2 p7(A,A) # label(p7_2) # label(negated_conjecture). [assumption].
% 0.42/0.99 3 p4(A,A) # label(p4_3) # label(negated_conjecture). [assumption].
% 0.42/0.99 4 p2(A,A) # label(p2_4) # label(negated_conjecture). [assumption].
% 0.42/0.99 5 p11(c15,c16) # label(p11_5) # label(negated_conjecture). [assumption].
% 0.42/0.99 6 p9(c12,c13) # label(p9_6) # label(negated_conjecture). [assumption].
% 0.42/0.99 7 p2(c14,f3(c15)) # label(p2_7) # label(negated_conjecture). [assumption].
% 0.42/0.99 8 -p8(c12,c13,c14) # label(not_p8_8) # label(negated_conjecture). [assumption].
% 0.42/0.99 15 p2(A,B) | -p2(C,A) | -p2(C,B) # label(p2_15) # label(negated_conjecture). [assumption].
% 0.42/0.99 16 p8(c12,A,B) | -p11(B,c16) | -p9(c12,A) # label(p8_16) # label(negated_conjecture). [assumption].
% 0.42/0.99 18 p9(c12,f6(A)) | p8(c12,B,f3(A)) | -p9(c12,B) # label(p9_18) # label(negated_conjecture). [assumption].
% 0.42/0.99 22 p8(c12,A,f3(B)) | -p9(c12,A) | -p8(c12,f6(B),B) # label(p8_22) # label(negated_conjecture). [assumption].
% 0.42/0.99 23 p8(A,B,C) | -p2(D,C) | -p4(E,B) | -p7(F,A) | -p8(F,E,D) # label(p8_23) # label(negated_conjecture). [assumption].
% 0.42/0.99 32 p2(A,B) | -p2(B,A). [resolve(15,c,4,a)].
% 0.42/0.99 33 p8(c12,A,c15) | -p9(c12,A). [resolve(16,b,5,a)].
% 0.42/0.99 54 p2(f3(c15),c14). [resolve(32,b,7,a)].
% 0.42/0.99 57 -p8(c12,c13,f3(c15)). [ur(23,a,8,a,b,54,a,c,3,a,d,2,a)].
% 0.42/0.99 66 -p8(c12,f6(c15),c15). [ur(22,a,57,a,b,6,a)].
% 0.42/0.99 79 -p9(c12,f6(c15)). [ur(33,a,66,a)].
% 0.42/0.99 81 $F. [ur(18,a,79,a,b,57,a),unit_del(a,6)].
% 0.42/0.99
% 0.42/0.99 % SZS output end Refutation
% 0.42/0.99 ============================== end of proof ==========================
% 0.42/0.99
% 0.42/0.99 ============================== STATISTICS ============================
% 0.42/0.99
% 0.42/0.99 Given=49. Generated=138. Kept=80. proofs=1.
% 0.42/0.99 Usable=49. Sos=31. Demods=0. Limbo=0, Disabled=23. Hints=0.
% 0.42/0.99 Megabytes=0.09.
% 0.42/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of statistics =====================
% 0.42/0.99
% 0.42/0.99 ============================== end of search =========================
% 0.42/0.99
% 0.42/0.99 THEOREM PROVED
% 0.42/0.99 % SZS status Unsatisfiable
% 0.42/0.99
% 0.42/0.99 Exiting with 1 proof.
% 0.42/0.99
% 0.42/0.99 Process 27657 exit (max_proofs) Tue Jul 12 05:44:40 2022
% 0.42/0.99 Prover9 interrupted
%------------------------------------------------------------------------------