TSTP Solution File: SYN713-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN713-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:22:03 EDT 2022
% Result : Unsatisfiable 0.50s 1.17s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN713-1 : TPTP v8.1.0. Released v2.5.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 11 23:27:12 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.50/1.17 ============================== Prover9 ===============================
% 0.50/1.17 Prover9 (32) version 2009-11A, November 2009.
% 0.50/1.17 Process 29289 was started by sandbox on n026.cluster.edu,
% 0.50/1.17 Mon Jul 11 23:27:13 2022
% 0.50/1.17 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29134_n026.cluster.edu".
% 0.50/1.17 ============================== end of head ===========================
% 0.50/1.17
% 0.50/1.17 ============================== INPUT =================================
% 0.50/1.17
% 0.50/1.17 % Reading from file /tmp/Prover9_29134_n026.cluster.edu
% 0.50/1.17
% 0.50/1.17 set(prolog_style_variables).
% 0.50/1.17 set(auto2).
% 0.50/1.17 % set(auto2) -> set(auto).
% 0.50/1.17 % set(auto) -> set(auto_inference).
% 0.50/1.17 % set(auto) -> set(auto_setup).
% 0.50/1.17 % set(auto_setup) -> set(predicate_elim).
% 0.50/1.17 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.50/1.17 % set(auto) -> set(auto_limits).
% 0.50/1.17 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.50/1.17 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.50/1.17 % set(auto) -> set(auto_denials).
% 0.50/1.17 % set(auto) -> set(auto_process).
% 0.50/1.17 % set(auto2) -> assign(new_constants, 1).
% 0.50/1.17 % set(auto2) -> assign(fold_denial_max, 3).
% 0.50/1.17 % set(auto2) -> assign(max_weight, "200.000").
% 0.50/1.17 % set(auto2) -> assign(max_hours, 1).
% 0.50/1.17 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.50/1.17 % set(auto2) -> assign(max_seconds, 0).
% 0.50/1.17 % set(auto2) -> assign(max_minutes, 5).
% 0.50/1.17 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.50/1.17 % set(auto2) -> set(sort_initial_sos).
% 0.50/1.17 % set(auto2) -> assign(sos_limit, -1).
% 0.50/1.17 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.50/1.17 % set(auto2) -> assign(max_megs, 400).
% 0.50/1.17 % set(auto2) -> assign(stats, some).
% 0.50/1.17 % set(auto2) -> clear(echo_input).
% 0.50/1.17 % set(auto2) -> set(quiet).
% 0.50/1.17 % set(auto2) -> clear(print_initial_clauses).
% 0.50/1.17 % set(auto2) -> clear(print_given).
% 0.50/1.17 assign(lrs_ticks,-1).
% 0.50/1.17 assign(sos_limit,10000).
% 0.50/1.17 assign(order,kbo).
% 0.50/1.17 set(lex_order_vars).
% 0.50/1.17 clear(print_given).
% 0.50/1.17
% 0.50/1.17 % formulas(sos). % not echoed (105 formulas)
% 0.50/1.17
% 0.50/1.17 ============================== end of input ==========================
% 0.50/1.17
% 0.50/1.17 % From the command line: assign(max_seconds, 300).
% 0.50/1.17
% 0.50/1.17 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.50/1.17
% 0.50/1.17 % Formulas that are not ordinary clauses:
% 0.50/1.17
% 0.50/1.17 ============================== end of process non-clausal formulas ===
% 0.50/1.17
% 0.50/1.17 ============================== PROCESS INITIAL CLAUSES ===============
% 0.50/1.17
% 0.50/1.17 ============================== PREDICATE ELIMINATION =================
% 0.50/1.17
% 0.50/1.17 ============================== end predicate elimination =============
% 0.50/1.17
% 0.50/1.17 Auto_denials: (non-Horn, no changes).
% 0.50/1.17
% 0.50/1.17 Term ordering decisions:
% 0.50/1.17 Function symbol KB weights: c74=1. c69=1. c65=1. c66=1. c68=1. c64=1. c67=1. c70=1. c72=1. c73=1. c78=1. c79=1. c80=1. c81=1. c61=1. c62=1. c63=1. c71=1. c75=1. c76=1. c77=1. f23=1. f26=1. f11=1. f14=1. f17=1. f19=1. f22=1. f35=1. f38=1. f41=1. f45=1. f47=1. f50=1. f52=1. f55=1. f28=1. f31=1. f33=1. f5=1. f8=1.
% 0.50/1.17
% 0.50/1.17 ============================== end of process initial clauses ========
% 0.50/1.17
% 0.50/1.17 ============================== CLAUSES FOR SEARCH ====================
% 0.50/1.17
% 0.50/1.17 ============================== end of clauses for search =============
% 0.50/1.17
% 0.50/1.17 ============================== SEARCH ================================
% 0.50/1.17
% 0.50/1.17 % Starting search at 0.03 seconds.
% 0.50/1.17
% 0.50/1.17 ============================== PROOF =================================
% 0.50/1.17 % SZS status Unsatisfiable
% 0.50/1.17 % SZS output start Refutation
% 0.50/1.17
% 0.50/1.17 % Proof 1 at 0.05 (+ 0.00) seconds.
% 0.50/1.17 % Length of proof is 23.
% 0.50/1.17 % Level of proof is 6.
% 0.50/1.17 % Maximum clause weight is 25.000.
% 0.50/1.17 % Given clauses 218.
% 0.50/1.17
% 0.50/1.17 2 p9(A,A) # label(p9_2) # label(negated_conjecture). [assumption].
% 0.50/1.17 14 p40(A,A) # label(p40_14) # label(negated_conjecture). [assumption].
% 0.50/1.17 34 p12(A,A) # label(p12_34) # label(negated_conjecture). [assumption].
% 0.50/1.17 35 p59(f38(c72,c77),f35(c73,c68)) # label(p59_35) # label(negated_conjecture). [assumption].
% 0.50/1.17 38 p56(f11(c65,f14(f17(c66,c67),c68)),c64) # label(p56_38) # label(negated_conjecture). [assumption].
% 0.50/1.17 39 -p57(f26(f28(c71,f41(c78,c64)),c67),c77) # label(not_p57_39) # label(negated_conjecture). [assumption].
% 0.50/1.17 74 p57(f26(f28(c71,A),B),C) | -p57(f26(A,B),C) # label(p57_74) # label(negated_conjecture). [assumption].
% 0.50/1.17 76 p56(A,B) | -p40(C,B) | -p56(D,C) | -p4(D,A) # label(p56_76) # label(negated_conjecture). [assumption].
% 0.50/1.17 80 -p58(f31(f33(c75,c76),f23(c69,c77)),f19(f22(c70,c69),c68)) # label(not_p58_80) # label(negated_conjecture). [assumption].
% 0.50/1.17 81 p10(f14(A,B),f14(C,D)) | -p12(A,C) | -p13(B,D) # label(p10_81) # label(negated_conjecture). [assumption].
% 0.50/1.17 87 p4(f11(A,B),f11(C,D)) | -p10(B,D) | -p9(A,C) # label(p4_87) # label(negated_conjecture). [assumption].
% 0.50/1.17 101 p57(f26(f41(c78,A),B),C) | -p56(f11(c65,f14(f17(c66,B),f23(c74,C))),A) # label(p57_101) # label(negated_conjecture). [assumption].
% 0.50/1.17 105 p13(A,f23(c74,B)) | p58(f31(f33(c75,c76),f23(c69,B)),f19(f22(c70,c69),A)) | -p59(f38(c72,B),f35(c73,A)) # label(p13_105) # label(negated_conjecture). [assumption].
% 0.50/1.17 142 p56(A,B) | -p40(c64,B) | -p4(f11(c65,f14(f17(c66,c67),c68)),A). [resolve(76,c,38,a)].
% 0.50/1.17 145 p10(f14(A,B),f14(A,C)) | -p13(B,C). [resolve(81,b,34,a)].
% 0.50/1.17 151 p4(f11(A,B),f11(A,C)) | -p10(B,C). [resolve(87,c,2,a)].
% 0.50/1.17 165 p13(c68,f23(c74,c77)). [resolve(105,c,35,a),unit_del(b,80)].
% 0.50/1.17 176 p10(f14(A,c68),f14(A,f23(c74,c77))). [resolve(145,b,165,a)].
% 0.50/1.17 180 p56(A,c64) | -p4(f11(c65,f14(f17(c66,c67),c68)),A). [resolve(142,b,14,a)].
% 0.50/1.17 195 p4(f11(A,f14(B,c68)),f11(A,f14(B,f23(c74,c77)))). [resolve(151,b,176,a)].
% 0.50/1.17 265 p56(f11(c65,f14(f17(c66,c67),f23(c74,c77))),c64). [resolve(195,a,180,b)].
% 0.50/1.17 268 p57(f26(f41(c78,c64),c67),c77). [resolve(265,a,101,b)].
% 0.50/1.17 271 $F. [resolve(268,a,74,b),unit_del(a,39)].
% 0.50/1.17
% 0.50/1.17 % SZS output end Refutation
% 0.50/1.17 ============================== end of proof ==========================
% 0.50/1.17
% 0.50/1.17 ============================== STATISTICS ============================
% 0.50/1.17
% 0.50/1.17 Given=218. Generated=481. Kept=270. proofs=1.
% 0.50/1.17 Usable=218. Sos=51. Demods=0. Limbo=1, Disabled=105. Hints=0.
% 0.50/1.17 Megabytes=0.66.
% 0.50/1.17 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.50/1.17
% 0.50/1.17 ============================== end of statistics =====================
% 0.50/1.17
% 0.50/1.17 ============================== end of search =========================
% 0.50/1.17
% 0.50/1.17 THEOREM PROVED
% 0.50/1.17 % SZS status Unsatisfiable
% 0.50/1.17
% 0.50/1.17 Exiting with 1 proof.
% 0.50/1.17
% 0.50/1.17 Process 29289 exit (max_proofs) Mon Jul 11 23:27:13 2022
% 0.50/1.17 Prover9 interrupted
%------------------------------------------------------------------------------