TSTP Solution File: SYN576-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN576-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:11 EDT 2022
% Result : Unsatisfiable 0.65s 1.03s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.16 % Problem : SYN576-1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/0.16 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.38 % Computer : n011.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8042.1875MB
% 0.12/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 600
% 0.12/0.38 % DateTime : Mon Jul 11 12:21:42 EDT 2022
% 0.12/0.38 % CPUTime :
% 0.65/1.03 ============================== Prover9 ===============================
% 0.65/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.65/1.03 Process 1236 was started by sandbox on n011.cluster.edu,
% 0.65/1.03 Mon Jul 11 12:21:43 2022
% 0.65/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1063_n011.cluster.edu".
% 0.65/1.03 ============================== end of head ===========================
% 0.65/1.03
% 0.65/1.03 ============================== INPUT =================================
% 0.65/1.03
% 0.65/1.03 % Reading from file /tmp/Prover9_1063_n011.cluster.edu
% 0.65/1.03
% 0.65/1.03 set(prolog_style_variables).
% 0.65/1.03 set(auto2).
% 0.65/1.03 % set(auto2) -> set(auto).
% 0.65/1.03 % set(auto) -> set(auto_inference).
% 0.65/1.03 % set(auto) -> set(auto_setup).
% 0.65/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.65/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.65/1.03 % set(auto) -> set(auto_limits).
% 0.65/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.65/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.65/1.03 % set(auto) -> set(auto_denials).
% 0.65/1.03 % set(auto) -> set(auto_process).
% 0.65/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.65/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.65/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.65/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.65/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.65/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.65/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.65/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.65/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.65/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.65/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.65/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.65/1.03 % set(auto2) -> assign(stats, some).
% 0.65/1.03 % set(auto2) -> clear(echo_input).
% 0.65/1.03 % set(auto2) -> set(quiet).
% 0.65/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.65/1.03 % set(auto2) -> clear(print_given).
% 0.65/1.03 assign(lrs_ticks,-1).
% 0.65/1.03 assign(sos_limit,10000).
% 0.65/1.03 assign(order,kbo).
% 0.65/1.03 set(lex_order_vars).
% 0.65/1.03 clear(print_given).
% 0.65/1.03
% 0.65/1.03 % formulas(sos). % not echoed (22 formulas)
% 0.65/1.03
% 0.65/1.03 ============================== end of input ==========================
% 0.65/1.03
% 0.65/1.03 % From the command line: assign(max_seconds, 300).
% 0.65/1.03
% 0.65/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.65/1.03
% 0.65/1.03 % Formulas that are not ordinary clauses:
% 0.65/1.03
% 0.65/1.03 ============================== end of process non-clausal formulas ===
% 0.65/1.03
% 0.65/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.65/1.03
% 0.65/1.03 ============================== PREDICATE ELIMINATION =================
% 0.65/1.03
% 0.65/1.03 ============================== end predicate elimination =============
% 0.65/1.03
% 0.65/1.03 Auto_denials: (non-Horn, no changes).
% 0.65/1.03
% 0.65/1.03 Term ordering decisions:
% 0.65/1.03 Function symbol KB weights: c13=1. c14=1. c15=1. c16=1. f3=1. f7=1. f6=1. f10=1. f9=1.
% 0.65/1.03
% 0.65/1.03 ============================== end of process initial clauses ========
% 0.65/1.03
% 0.65/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.65/1.03
% 0.65/1.03 ============================== end of clauses for search =============
% 0.65/1.03
% 0.65/1.03 ============================== SEARCH ================================
% 0.65/1.03
% 0.65/1.03 % Starting search at 0.01 seconds.
% 0.65/1.03
% 0.65/1.03 ============================== PROOF =================================
% 0.65/1.03 % SZS status Unsatisfiable
% 0.65/1.03 % SZS output start Refutation
% 0.65/1.03
% 0.65/1.03 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.65/1.03 % Length of proof is 27.
% 0.65/1.03 % Level of proof is 5.
% 0.65/1.03 % Maximum clause weight is 26.000.
% 0.65/1.03 % Given clauses 157.
% 0.65/1.03
% 0.65/1.03 1 p8(A,A) # label(p8_1) # label(negated_conjecture). [assumption].
% 0.65/1.03 2 p2(A,A) # label(p2_2) # label(negated_conjecture). [assumption].
% 0.65/1.03 3 p4(A,A) # label(p4_3) # label(negated_conjecture). [assumption].
% 0.65/1.03 4 p5(A,A) # label(p5_4) # label(negated_conjecture). [assumption].
% 0.65/1.03 5 p12(c15,f6(c13)) # label(p12_5) # label(negated_conjecture). [assumption].
% 0.65/1.03 6 p12(c16,f6(c13)) # label(p12_6) # label(negated_conjecture). [assumption].
% 0.65/1.03 7 p11(A,B) | p11(B,A) # label(p11_7) # label(negated_conjecture). [assumption].
% 0.65/1.03 8 p2(f3(A,B),f3(B,A)) # label(p2_8) # label(negated_conjecture). [assumption].
% 0.65/1.03 9 -p12(f7(f9(c13,c14,f3(c15,c16)),f3(c15,c16)),f6(c13)) # label(not_p12_17) # label(negated_conjecture). [assumption].
% 0.65/1.03 17 p12(A,B) | -p2(C,A) | -p5(D,B) | -p12(C,D) # label(p12_16) # label(negated_conjecture). [assumption].
% 0.65/1.03 19 p2(f7(A,B),f7(C,D)) | -p2(A,C) | -p2(B,D) # label(p2_19) # label(negated_conjecture). [assumption].
% 0.65/1.03 20 p2(f9(A,B,C),f9(D,E,F)) | -p4(A,D) | -p8(B,E) | -p2(C,F) # label(p2_20) # label(negated_conjecture). [assumption].
% 0.65/1.03 22 p12(f7(f9(A,c14,f3(B,C)),f3(B,C)),f6(A)) | -p12(C,f6(A)) | -p12(B,f6(A)) | -p11(f10(B),f10(C)) # label(p12_22) # label(negated_conjecture). [assumption].
% 0.65/1.03 37 p12(A,B) | -p2(C,A) | -p12(C,B). [resolve(17,c,4,a)].
% 0.65/1.03 45 p2(f7(A,B),f7(A,C)) | -p2(B,C). [resolve(19,b,2,a)].
% 0.65/1.03 47 p2(f7(A,B),f7(C,B)) | -p2(A,C). [resolve(19,c,2,a)].
% 0.65/1.03 48 p2(f9(A,B,C),f9(D,B,E)) | -p4(A,D) | -p2(C,E). [resolve(20,c,1,a)].
% 0.65/1.03 51 -p11(f10(c15),f10(c16)). [ur(22,a,9,a,b,6,a,c,5,a)].
% 0.65/1.03 68 p11(f10(c16),f10(c15)). [resolve(51,a,7,b)].
% 0.65/1.03 73 p12(f7(f9(A,c14,f3(c16,c15)),f3(c16,c15)),f6(A)) | -p12(c15,f6(A)) | -p12(c16,f6(A)). [resolve(68,a,22,d)].
% 0.65/1.03 107 p2(f7(A,f3(B,C)),f7(A,f3(C,B))). [resolve(45,b,8,a)].
% 0.65/1.03 224 -p12(f7(f9(c13,c14,f3(c15,c16)),f3(c16,c15)),f6(c13)). [ur(37,a,9,a,b,107,a)].
% 0.65/1.03 229 p2(f9(A,B,C),f9(A,B,D)) | -p2(C,D). [resolve(48,b,3,a)].
% 0.65/1.03 351 p2(f9(A,B,f3(C,D)),f9(A,B,f3(D,C))). [resolve(229,b,8,a)].
% 0.65/1.03 733 p2(f7(f9(A,B,f3(C,D)),E),f7(f9(A,B,f3(D,C)),E)). [resolve(351,a,47,b)].
% 0.65/1.03 885 p12(f7(f9(c13,c14,f3(c16,c15)),f3(c16,c15)),f6(c13)). [resolve(73,c,6,a),unit_del(b,5)].
% 0.65/1.03 900 $F. [ur(37,a,224,a,c,885,a),unit_del(a,733)].
% 0.65/1.03
% 0.65/1.03 % SZS output end Refutation
% 0.65/1.03 ============================== end of proof ==========================
% 0.65/1.03
% 0.65/1.03 ============================== STATISTICS ============================
% 0.65/1.03
% 0.65/1.03 Given=157. Generated=1423. Kept=899. proofs=1.
% 0.65/1.03 Usable=154. Sos=733. Demods=0. Limbo=7, Disabled=27. Hints=0.
% 0.65/1.03 Megabytes=0.94.
% 0.65/1.03 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.65/1.03
% 0.65/1.03 ============================== end of statistics =====================
% 0.65/1.03
% 0.65/1.03 ============================== end of search =========================
% 0.65/1.03
% 0.65/1.03 THEOREM PROVED
% 0.65/1.03 % SZS status Unsatisfiable
% 0.65/1.03
% 0.65/1.03 Exiting with 1 proof.
% 0.65/1.03
% 0.65/1.03 Process 1236 exit (max_proofs) Mon Jul 11 12:21:43 2022
% 0.65/1.03 Prover9 interrupted
%------------------------------------------------------------------------------