TSTP Solution File: SYN641-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN641-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:36 EDT 2022
% Result : Unsatisfiable 0.80s 1.13s
% Output : Refutation 0.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN641-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n015.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 18:03:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.80/1.13 ============================== Prover9 ===============================
% 0.80/1.13 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.13 Process 10706 was started by sandbox2 on n015.cluster.edu,
% 0.80/1.13 Mon Jul 11 18:03:10 2022
% 0.80/1.13 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_10446_n015.cluster.edu".
% 0.80/1.13 ============================== end of head ===========================
% 0.80/1.13
% 0.80/1.13 ============================== INPUT =================================
% 0.80/1.13
% 0.80/1.13 % Reading from file /tmp/Prover9_10446_n015.cluster.edu
% 0.80/1.13
% 0.80/1.13 set(prolog_style_variables).
% 0.80/1.13 set(auto2).
% 0.80/1.13 % set(auto2) -> set(auto).
% 0.80/1.13 % set(auto) -> set(auto_inference).
% 0.80/1.13 % set(auto) -> set(auto_setup).
% 0.80/1.13 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.13 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.13 % set(auto) -> set(auto_limits).
% 0.80/1.13 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.13 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.13 % set(auto) -> set(auto_denials).
% 0.80/1.13 % set(auto) -> set(auto_process).
% 0.80/1.13 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.13 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.13 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.13 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.13 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.13 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.13 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.13 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.13 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.13 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.13 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.13 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.13 % set(auto2) -> assign(stats, some).
% 0.80/1.13 % set(auto2) -> clear(echo_input).
% 0.80/1.13 % set(auto2) -> set(quiet).
% 0.80/1.13 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.13 % set(auto2) -> clear(print_given).
% 0.80/1.13 assign(lrs_ticks,-1).
% 0.80/1.13 assign(sos_limit,10000).
% 0.80/1.13 assign(order,kbo).
% 0.80/1.13 set(lex_order_vars).
% 0.80/1.13 clear(print_given).
% 0.80/1.13
% 0.80/1.13 % formulas(sos). % not echoed (42 formulas)
% 0.80/1.13
% 0.80/1.13 ============================== end of input ==========================
% 0.80/1.13
% 0.80/1.13 % From the command line: assign(max_seconds, 300).
% 0.80/1.13
% 0.80/1.13 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.13
% 0.80/1.13 % Formulas that are not ordinary clauses:
% 0.80/1.13
% 0.80/1.13 ============================== end of process non-clausal formulas ===
% 0.80/1.13
% 0.80/1.13 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.13
% 0.80/1.13 ============================== PREDICATE ELIMINATION =================
% 0.80/1.13
% 0.80/1.13 ============================== end predicate elimination =============
% 0.80/1.13
% 0.80/1.13 Auto_denials: (non-Horn, no changes).
% 0.80/1.13
% 0.80/1.13 Term ordering decisions:
% 0.80/1.13 Function symbol KB weights: c18=1. c19=1. c20=1. f10=1. f9=1. f14=1. f3=1. f13=1. f5=1. f7=1. f8=1.
% 0.80/1.13
% 0.80/1.13 ============================== end of process initial clauses ========
% 0.80/1.13
% 0.80/1.13 ============================== CLAUSES FOR SEARCH ====================
% 0.80/1.13
% 0.80/1.13 ============================== end of clauses for search =============
% 0.80/1.13
% 0.80/1.13 ============================== SEARCH ================================
% 0.80/1.13
% 0.80/1.13 % Starting search at 0.02 seconds.
% 0.80/1.13
% 0.80/1.13 ============================== PROOF =================================
% 0.80/1.13 % SZS status Unsatisfiable
% 0.80/1.13 % SZS output start Refutation
% 0.80/1.13
% 0.80/1.13 % Proof 1 at 0.07 (+ 0.00) seconds.
% 0.80/1.13 % Length of proof is 19.
% 0.80/1.13 % Level of proof is 7.
% 0.80/1.13 % Maximum clause weight is 14.000.
% 0.80/1.13 % Given clauses 154.
% 0.80/1.13
% 0.80/1.13 1 p15(f3(c19)) # label(f3_is_p15_1) # label(negated_conjecture). [assumption].
% 0.80/1.13 2 p15(f3(c18)) # label(f3_is_p15_2) # label(negated_conjecture). [assumption].
% 0.80/1.13 4 p6(A,A) # label(p6_4) # label(negated_conjecture). [assumption].
% 0.80/1.13 12 p6(f7(f3(c18)),f7(c18)) # label(p6_12) # label(negated_conjecture). [assumption].
% 0.80/1.13 13 p6(f7(f3(c19)),f7(c19)) # label(p6_13) # label(negated_conjecture). [assumption].
% 0.80/1.13 15 -p6(f7(f10(f3(c19),f3(c18))),f9(f7(c19),f7(c18))) # label(not_p6_28) # label(negated_conjecture). [assumption].
% 0.80/1.13 24 p6(A,B) | -p6(C,A) | -p6(C,B) # label(p6_23) # label(negated_conjecture). [assumption].
% 0.80/1.13 33 p6(f9(A,B),f9(C,D)) | -p6(B,D) | -p6(A,C) # label(p6_33) # label(negated_conjecture). [assumption].
% 0.80/1.13 38 p6(f7(f10(A,B)),f9(f7(A),f7(B))) | -p15(A) | -p15(B) # label(p6_38) # label(negated_conjecture). [assumption].
% 0.80/1.13 65 p6(A,B) | -p6(B,A). [resolve(24,c,4,a)].
% 0.80/1.13 77 p6(f9(A,f7(f3(c18))),f9(B,f7(c18))) | -p6(A,B). [resolve(33,b,12,a)].
% 0.80/1.13 79 p6(f9(A,B),f9(C,B)) | -p6(A,C). [resolve(33,b,4,a)].
% 0.80/1.13 433 p6(f9(A,f7(f3(c18))),f9(A,f7(c18))). [resolve(77,b,4,a)].
% 0.80/1.13 504 p6(f9(f7(f3(c19)),A),f9(f7(c19),A)). [resolve(79,b,13,a)].
% 0.80/1.13 802 -p6(f9(f7(c19),f7(f3(c18))),f7(f10(f3(c19),f3(c18)))). [ur(24,a,15,a,c,433,a)].
% 0.80/1.13 850 -p6(f7(f10(f3(c19),f3(c18))),f9(f7(c19),f7(f3(c18)))). [ur(65,a,802,a)].
% 0.80/1.13 911 -p6(f9(f7(f3(c19)),f7(f3(c18))),f7(f10(f3(c19),f3(c18)))). [ur(24,a,850,a,c,504,a)].
% 0.80/1.13 916 -p6(f7(f10(f3(c19),f3(c18))),f9(f7(f3(c19)),f7(f3(c18)))). [ur(65,a,911,a)].
% 0.80/1.13 917 $F. [ur(38,a,916,a,c,2,a),unit_del(a,1)].
% 0.80/1.13
% 0.80/1.13 % SZS output end Refutation
% 0.80/1.13 ============================== end of proof ==========================
% 0.80/1.13
% 0.80/1.13 ============================== STATISTICS ============================
% 0.80/1.13
% 0.80/1.13 Given=154. Generated=1121. Kept=916. proofs=1.
% 0.80/1.13 Usable=154. Sos=762. Demods=0. Limbo=0, Disabled=42. Hints=0.
% 0.80/1.13 Megabytes=0.91.
% 0.80/1.13 User_CPU=0.07, System_CPU=0.00, Wall_clock=0.
% 0.80/1.13
% 0.80/1.13 ============================== end of statistics =====================
% 0.80/1.13
% 0.80/1.13 ============================== end of search =========================
% 0.80/1.13
% 0.80/1.13 THEOREM PROVED
% 0.80/1.13 % SZS status Unsatisfiable
% 0.80/1.13
% 0.80/1.13 Exiting with 1 proof.
% 0.80/1.13
% 0.80/1.13 Process 10706 exit (max_proofs) Mon Jul 11 18:03:10 2022
% 0.80/1.13 Prover9 interrupted
%------------------------------------------------------------------------------