TSTP Solution File: SYN570-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN570-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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:09 EDT 2022
% Result : Unsatisfiable 0.44s 0.96s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN570-1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 04:29:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/0.96 ============================== Prover9 ===============================
% 0.44/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.96 Process 11535 was started by sandbox2 on n008.cluster.edu,
% 0.44/0.96 Tue Jul 12 04:29:54 2022
% 0.44/0.96 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11382_n008.cluster.edu".
% 0.44/0.96 ============================== end of head ===========================
% 0.44/0.96
% 0.44/0.96 ============================== INPUT =================================
% 0.44/0.96
% 0.44/0.96 % Reading from file /tmp/Prover9_11382_n008.cluster.edu
% 0.44/0.96
% 0.44/0.96 set(prolog_style_variables).
% 0.44/0.96 set(auto2).
% 0.44/0.96 % set(auto2) -> set(auto).
% 0.44/0.96 % set(auto) -> set(auto_inference).
% 0.44/0.96 % set(auto) -> set(auto_setup).
% 0.44/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.96 % set(auto) -> set(auto_limits).
% 0.44/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.96 % set(auto) -> set(auto_denials).
% 0.44/0.96 % set(auto) -> set(auto_process).
% 0.44/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.96 % set(auto2) -> assign(stats, some).
% 0.44/0.96 % set(auto2) -> clear(echo_input).
% 0.44/0.96 % set(auto2) -> set(quiet).
% 0.44/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.96 % set(auto2) -> clear(print_given).
% 0.44/0.96 assign(lrs_ticks,-1).
% 0.44/0.96 assign(sos_limit,10000).
% 0.44/0.96 assign(order,kbo).
% 0.44/0.96 set(lex_order_vars).
% 0.44/0.96 clear(print_given).
% 0.44/0.96
% 0.44/0.96 % formulas(sos). % not echoed (20 formulas)
% 0.44/0.96
% 0.44/0.96 ============================== end of input ==========================
% 0.44/0.96
% 0.44/0.96 % From the command line: assign(max_seconds, 300).
% 0.44/0.96
% 0.44/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.96
% 0.44/0.96 % Formulas that are not ordinary clauses:
% 0.44/0.96
% 0.44/0.96 ============================== end of process non-clausal formulas ===
% 0.44/0.96
% 0.44/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.96
% 0.44/0.96 ============================== PREDICATE ELIMINATION =================
% 0.44/0.96
% 0.44/0.96 ============================== end predicate elimination =============
% 0.44/0.96
% 0.44/0.96 Auto_denials:
% 0.44/0.96 % copying label not_p9_10 to answer in negative clause
% 0.44/0.96
% 0.44/0.96 Term ordering decisions:
% 0.44/0.96 Function symbol KB weights: c12=1. c15=1. c13=1. c14=1. f5=1. f4=1. f8=1.
% 0.44/0.96
% 0.44/0.96 ============================== end of process initial clauses ========
% 0.44/0.96
% 0.44/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.96
% 0.44/0.96 ============================== end of clauses for search =============
% 0.44/0.96
% 0.44/0.96 ============================== SEARCH ================================
% 0.44/0.96
% 0.44/0.96 % Starting search at 0.01 seconds.
% 0.44/0.96
% 0.44/0.96 ============================== PROOF =================================
% 0.44/0.96 % SZS status Unsatisfiable
% 0.44/0.96 % SZS output start Refutation
% 0.44/0.96
% 0.44/0.96 % Proof 1 at 0.01 (+ 0.00) seconds: not_p9_10.
% 0.44/0.96 % Length of proof is 15.
% 0.44/0.96 % Level of proof is 4.
% 0.44/0.96 % Maximum clause weight is 12.000.
% 0.44/0.96 % Given clauses 25.
% 0.44/0.96
% 0.44/0.96 2 p7(A,A) # label(p7_2) # label(negated_conjecture). [assumption].
% 0.44/0.96 5 p2(A,A) # label(p2_5) # label(negated_conjecture). [assumption].
% 0.44/0.96 7 p9(c15,f8(c13)) # label(p9_7) # label(negated_conjecture). [assumption].
% 0.44/0.96 8 p2(c12,f5(c15)) # label(p2_8) # label(negated_conjecture). [assumption].
% 0.44/0.96 9 p3(f4(f5(A)),A) # label(p3_9) # label(negated_conjecture). [assumption].
% 0.44/0.96 10 -p9(f4(c12),f8(c13)) # label(not_p9_10) # label(negated_conjecture) # answer(not_p9_10). [assumption].
% 0.44/0.96 13 p3(f4(A),f4(B)) | -p2(A,B) # label(p3_13) # label(negated_conjecture). [assumption].
% 0.44/0.96 17 p3(A,B) | -p3(C,A) | -p3(C,B) # label(p3_17) # label(negated_conjecture). [assumption].
% 0.44/0.96 18 p2(A,B) | -p2(C,A) | -p2(C,B) # label(p2_18) # label(negated_conjecture). [assumption].
% 0.44/0.96 19 p9(A,B) | -p7(C,B) | -p9(D,C) | -p3(D,A) # label(p9_19) # label(negated_conjecture). [assumption].
% 0.44/0.96 24 p2(f5(c15),c12). [ur(18,b,8,a,c,5,a)].
% 0.44/0.96 27 -p3(c15,f4(c12)) # answer(not_p9_10). [ur(19,a,10,a,b,2,a,c,7,a)].
% 0.44/0.96 33 -p3(f4(f5(c15)),f4(c12)) # answer(not_p9_10). [ur(17,a,27,a,b,9,a)].
% 0.44/0.96 39 -p2(f5(c15),c12) # answer(not_p9_10). [resolve(33,a,13,a)].
% 0.44/0.96 40 $F # answer(not_p9_10). [resolve(39,a,24,a)].
% 0.44/0.96
% 0.44/0.96 % SZS output end Refutation
% 0.44/0.96 ============================== end of proof ==========================
% 0.44/0.96
% 0.44/0.96 ============================== STATISTICS ============================
% 0.44/0.96
% 0.44/0.96 Given=25. Generated=65. Kept=39. proofs=1.
% 0.44/0.96 Usable=25. Sos=12. Demods=0. Limbo=1, Disabled=20. Hints=0.
% 0.44/0.96 Megabytes=0.06.
% 0.44/0.96 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.96
% 0.44/0.96 ============================== end of statistics =====================
% 0.44/0.96
% 0.44/0.96 ============================== end of search =========================
% 0.44/0.96
% 0.44/0.96 THEOREM PROVED
% 0.44/0.96 % SZS status Unsatisfiable
% 0.44/0.96
% 0.44/0.96 Exiting with 1 proof.
% 0.44/0.96
% 0.44/0.96 Process 11535 exit (max_proofs) Tue Jul 12 04:29:54 2022
% 0.44/0.96 Prover9 interrupted
%------------------------------------------------------------------------------