TSTP Solution File: SYN624-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN624-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:29 EDT 2022
% Result : Unsatisfiable 0.74s 1.03s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN624-1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/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 07:27:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.03 ============================== Prover9 ===============================
% 0.74/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.03 Process 26090 was started by sandbox2 on n022.cluster.edu,
% 0.74/1.03 Tue Jul 12 07:27:25 2022
% 0.74/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25937_n022.cluster.edu".
% 0.74/1.03 ============================== end of head ===========================
% 0.74/1.03
% 0.74/1.03 ============================== INPUT =================================
% 0.74/1.03
% 0.74/1.03 % Reading from file /tmp/Prover9_25937_n022.cluster.edu
% 0.74/1.03
% 0.74/1.03 set(prolog_style_variables).
% 0.74/1.03 set(auto2).
% 0.74/1.03 % set(auto2) -> set(auto).
% 0.74/1.03 % set(auto) -> set(auto_inference).
% 0.74/1.03 % set(auto) -> set(auto_setup).
% 0.74/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.03 % set(auto) -> set(auto_limits).
% 0.74/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.03 % set(auto) -> set(auto_denials).
% 0.74/1.03 % set(auto) -> set(auto_process).
% 0.74/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.03 % set(auto2) -> assign(stats, some).
% 0.74/1.03 % set(auto2) -> clear(echo_input).
% 0.74/1.03 % set(auto2) -> set(quiet).
% 0.74/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.03 % set(auto2) -> clear(print_given).
% 0.74/1.03 assign(lrs_ticks,-1).
% 0.74/1.03 assign(sos_limit,10000).
% 0.74/1.03 assign(order,kbo).
% 0.74/1.03 set(lex_order_vars).
% 0.74/1.03 clear(print_given).
% 0.74/1.03
% 0.74/1.03 % formulas(sos). % not echoed (35 formulas)
% 0.74/1.03
% 0.74/1.03 ============================== end of input ==========================
% 0.74/1.03
% 0.74/1.03 % From the command line: assign(max_seconds, 300).
% 0.74/1.03
% 0.74/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.03
% 0.74/1.03 % Formulas that are not ordinary clauses:
% 0.74/1.03
% 0.74/1.03 ============================== end of process non-clausal formulas ===
% 0.74/1.03
% 0.74/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.03
% 0.74/1.03 ============================== PREDICATE ELIMINATION =================
% 0.74/1.03
% 0.74/1.03 ============================== end predicate elimination =============
% 0.74/1.03
% 0.74/1.03 Auto_denials: (non-Horn, no changes).
% 0.74/1.03
% 0.74/1.03 Term ordering decisions:
% 0.74/1.03 Function symbol KB weights: c23=1. c24=1. c25=1. c22=1. c26=1. f13=1. f16=1. f17=1. f6=1. f7=1. f12=1. f14=1. f15=1. f4=1. f8=1. f9=1.
% 0.74/1.03
% 0.74/1.03 ============================== end of process initial clauses ========
% 0.74/1.03
% 0.74/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.03
% 0.74/1.03 ============================== end of clauses for search =============
% 0.74/1.03
% 0.74/1.03 ============================== SEARCH ================================
% 0.74/1.03
% 0.74/1.03 % Starting search at 0.01 seconds.
% 0.74/1.03
% 0.74/1.03 ============================== PROOF =================================
% 0.74/1.03 % SZS status Unsatisfiable
% 0.74/1.03 % SZS output start Refutation
% 0.74/1.03
% 0.74/1.03 % Proof 1 at 0.05 (+ 0.00) seconds.
% 0.74/1.03 % Length of proof is 12.
% 0.74/1.03 % Level of proof is 3.
% 0.74/1.03 % Maximum clause weight is 13.000.
% 0.74/1.03 % Given clauses 193.
% 0.74/1.03
% 0.74/1.03 1 p10(A,A) # label(p10_1) # label(negated_conjecture). [assumption].
% 0.74/1.03 2 p5(A,A) # label(p5_2) # label(negated_conjecture). [assumption].
% 0.74/1.03 8 p10(f16(A,f14(f15(f7(c25)))),A) # label(p10_11) # label(negated_conjecture). [assumption].
% 0.74/1.03 9 p10(f13(f6(c22),A),f13(f6(c24),f16(c26,A))) # label(p10_26) # label(negated_conjecture). [assumption].
% 0.74/1.03 14 -p10(f13(f6(c24),c26),f13(f6(c22),f14(f15(f7(c25))))) # label(not_p10_28) # label(negated_conjecture). [assumption].
% 0.74/1.03 24 p10(A,B) | -p10(C,A) | -p10(C,B) # label(p10_21) # label(negated_conjecture). [assumption].
% 0.74/1.03 32 p10(f13(A,B),f13(C,D)) | -p10(B,D) | -p5(A,C) # label(p10_32) # label(negated_conjecture). [assumption].
% 0.74/1.03 50 p10(A,B) | -p10(B,A). [resolve(24,c,1,a)].
% 0.74/1.03 66 p10(f13(A,B),f13(A,C)) | -p10(B,C). [resolve(32,c,2,a)].
% 0.74/1.03 103 p10(f13(f6(c24),f16(c26,A)),f13(f6(c22),A)). [resolve(50,b,9,a)].
% 0.74/1.03 318 p10(f13(A,f16(B,f14(f15(f7(c25))))),f13(A,B)). [resolve(66,b,8,a)].
% 0.74/1.03 493 $F. [ur(24,a,14,a,c,103,a),unit_del(a,318)].
% 0.74/1.03
% 0.74/1.03 % SZS output end Refutation
% 0.74/1.03 ============================== end of proof ==========================
% 0.74/1.03
% 0.74/1.03 ============================== STATISTICS ============================
% 0.74/1.03
% 0.74/1.03 Given=193. Generated=1187. Kept=492. proofs=1.
% 0.74/1.03 Usable=193. Sos=281. Demods=0. Limbo=16, Disabled=37. Hints=0.
% 0.74/1.03 Megabytes=0.59.
% 0.74/1.03 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.74/1.03
% 0.74/1.03 ============================== end of statistics =====================
% 0.74/1.03
% 0.74/1.03 ============================== end of search =========================
% 0.74/1.03
% 0.74/1.03 THEOREM PROVED
% 0.74/1.03 % SZS status Unsatisfiable
% 0.74/1.03
% 0.74/1.03 Exiting with 1 proof.
% 0.74/1.03
% 0.74/1.03 Process 26090 exit (max_proofs) Tue Jul 12 07:27:25 2022
% 0.74/1.03 Prover9 interrupted
%------------------------------------------------------------------------------