TSTP Solution File: SYN599-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN599-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:20 EDT 2022
% Result : Unsatisfiable 0.67s 1.00s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN599-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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 04:11:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/1.00 ============================== Prover9 ===============================
% 0.67/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.67/1.00 Process 31270 was started by sandbox2 on n023.cluster.edu,
% 0.67/1.00 Tue Jul 12 04:11:10 2022
% 0.67/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_31116_n023.cluster.edu".
% 0.67/1.00 ============================== end of head ===========================
% 0.67/1.00
% 0.67/1.00 ============================== INPUT =================================
% 0.67/1.00
% 0.67/1.00 % Reading from file /tmp/Prover9_31116_n023.cluster.edu
% 0.67/1.00
% 0.67/1.00 set(prolog_style_variables).
% 0.67/1.00 set(auto2).
% 0.67/1.00 % set(auto2) -> set(auto).
% 0.67/1.00 % set(auto) -> set(auto_inference).
% 0.67/1.00 % set(auto) -> set(auto_setup).
% 0.67/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.67/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/1.00 % set(auto) -> set(auto_limits).
% 0.67/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/1.00 % set(auto) -> set(auto_denials).
% 0.67/1.00 % set(auto) -> set(auto_process).
% 0.67/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.67/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.67/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.67/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.67/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.67/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.67/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.67/1.00 % set(auto2) -> assign(stats, some).
% 0.67/1.00 % set(auto2) -> clear(echo_input).
% 0.67/1.00 % set(auto2) -> set(quiet).
% 0.67/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.67/1.00 % set(auto2) -> clear(print_given).
% 0.67/1.00 assign(lrs_ticks,-1).
% 0.67/1.00 assign(sos_limit,10000).
% 0.67/1.00 assign(order,kbo).
% 0.67/1.00 set(lex_order_vars).
% 0.67/1.00 clear(print_given).
% 0.67/1.00
% 0.67/1.00 % formulas(sos). % not echoed (29 formulas)
% 0.67/1.00
% 0.67/1.00 ============================== end of input ==========================
% 0.67/1.00
% 0.67/1.00 % From the command line: assign(max_seconds, 300).
% 0.67/1.00
% 0.67/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/1.00
% 0.67/1.00 % Formulas that are not ordinary clauses:
% 0.67/1.00
% 0.67/1.00 ============================== end of process non-clausal formulas ===
% 0.67/1.00
% 0.67/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/1.00
% 0.67/1.00 ============================== PREDICATE ELIMINATION =================
% 0.67/1.00
% 0.67/1.00 ============================== end predicate elimination =============
% 0.67/1.00
% 0.67/1.00 Auto_denials:
% 0.67/1.00 % copying label not_p19_27 to answer in negative clause
% 0.67/1.00
% 0.67/1.00 Term ordering decisions:
% 0.67/1.00 Function symbol KB weights: c23=1. c21=1. c22=1. f9=1. f8=1. f11=1. f10=1. f12=1. f13=1. f4=1. f6=1. f15=1. f16=1. f14=1.
% 0.67/1.00
% 0.67/1.00 ============================== end of process initial clauses ========
% 0.67/1.00
% 0.67/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.67/1.00
% 0.67/1.00 ============================== end of clauses for search =============
% 0.67/1.00
% 0.67/1.00 ============================== SEARCH ================================
% 0.67/1.00
% 0.67/1.00 % Starting search at 0.01 seconds.
% 0.67/1.00
% 0.67/1.00 ============================== PROOF =================================
% 0.67/1.00 % SZS status Unsatisfiable
% 0.67/1.00 % SZS output start Refutation
% 0.67/1.00
% 0.67/1.00 % Proof 1 at 0.02 (+ 0.00) seconds: not_p19_27.
% 0.67/1.00 % Length of proof is 18.
% 0.67/1.00 % Level of proof is 7.
% 0.67/1.00 % Maximum clause weight is 34.000.
% 0.67/1.00 % Given clauses 50.
% 0.67/1.00
% 0.67/1.00 2 p18(c21) # label(c21_is_p18_2) # label(negated_conjecture). [assumption].
% 0.67/1.00 3 p7(A,A) # label(p7_3) # label(negated_conjecture). [assumption].
% 0.67/1.00 7 p3(f4(f6(c21)),c22) # label(p3_7) # label(negated_conjecture). [assumption].
% 0.67/1.00 8 -p19(f15(f16(c21)),f8(f9(f12(f10(f13(f11(c23)))),f14(c22)),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) # label(not_p19_27) # label(negated_conjecture) # answer(not_p19_27). [assumption].
% 0.67/1.00 16 p3(f14(A),f14(B)) | -p3(A,B) # label(p3_15) # label(negated_conjecture). [assumption].
% 0.67/1.00 24 p19(A,B) | -p7(C,A) | -p7(D,B) | -p19(C,D) # label(p19_23) # label(negated_conjecture). [assumption].
% 0.67/1.00 26 p7(f9(A,B),f9(C,D)) | -p3(B,D) | -p7(A,C) # label(p7_25) # label(negated_conjecture). [assumption].
% 0.67/1.00 27 p7(f8(A,B),f8(C,D)) | -p7(A,C) | -p7(B,D) # label(p7_26) # label(negated_conjecture). [assumption].
% 0.67/1.00 29 p19(f15(f16(A)),f8(f9(f12(f10(f13(f11(c23)))),f14(f4(f6(A)))),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) | -p18(A) # label(p19_29) # label(negated_conjecture). [assumption].
% 0.67/1.00 33 p3(f14(f4(f6(c21))),f14(c22)). [ur(16,b,7,a)].
% 0.67/1.00 36 -p7(A,f15(f16(c21))) | -p7(B,f8(f9(f12(f10(f13(f11(c23)))),f14(c22)),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) | -p19(A,B) # answer(not_p19_27). [resolve(24,a,8,a)].
% 0.67/1.00 49 -p7(A,f8(f9(f12(f10(f13(f11(c23)))),f14(c22)),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) | -p19(f15(f16(c21)),A) # answer(not_p19_27). [resolve(36,a,3,a)].
% 0.67/1.00 55 -p19(f15(f16(c21)),f8(A,B)) | -p7(A,f9(f12(f10(f13(f11(c23)))),f14(c22))) | -p7(B,f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23)))))))))) # answer(not_p19_27). [resolve(49,a,27,a)].
% 0.67/1.00 82 p7(f9(A,f14(f4(f6(c21)))),f9(A,f14(c22))). [ur(26,b,33,a,c,3,a)].
% 0.67/1.00 114 -p19(f15(f16(c21)),f8(A,f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) | -p7(A,f9(f12(f10(f13(f11(c23)))),f14(c22))) # answer(not_p19_27). [resolve(55,c,3,a)].
% 0.67/1.00 173 -p7(f9(f12(f10(f13(f11(c23)))),f14(f4(f6(c21)))),f9(f12(f10(f13(f11(c23)))),f14(c22))) | -p18(c21) # answer(not_p19_27). [resolve(114,a,29,a)].
% 0.67/1.00 180 -p7(f9(f12(f10(f13(f11(c23)))),f14(f4(f6(c21)))),f9(f12(f10(f13(f11(c23)))),f14(c22))) # answer(not_p19_27). [resolve(173,b,2,a)].
% 0.67/1.00 181 $F # answer(not_p19_27). [resolve(180,a,82,a)].
% 0.67/1.00
% 0.67/1.00 % SZS output end Refutation
% 0.67/1.00 ============================== end of proof ==========================
% 0.67/1.00
% 0.67/1.00 ============================== STATISTICS ============================
% 0.67/1.00
% 0.67/1.00 Given=50. Generated=264. Kept=180. proofs=1.
% 0.67/1.00 Usable=50. Sos=125. Demods=0. Limbo=3, Disabled=30. Hints=0.
% 0.67/1.00 Megabytes=0.27.
% 0.67/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.67/1.00
% 0.67/1.00 ============================== end of statistics =====================
% 0.67/1.00
% 0.67/1.00 ============================== end of search =========================
% 0.67/1.00
% 0.67/1.00 THEOREM PROVED
% 0.67/1.00 % SZS status Unsatisfiable
% 0.67/1.00
% 0.67/1.00 Exiting with 1 proof.
% 0.67/1.00
% 0.67/1.00 Process 31270 exit (max_proofs) Tue Jul 12 04:11:10 2022
% 0.67/1.00 Prover9 interrupted
%------------------------------------------------------------------------------