TSTP Solution File: SYN573-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN573-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:10 EDT 2022
% Result : Unsatisfiable 0.71s 0.99s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN573-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 : n011.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 02:03:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/0.99 ============================== Prover9 ===============================
% 0.71/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.99 Process 32126 was started by sandbox on n011.cluster.edu,
% 0.71/0.99 Tue Jul 12 02:03:28 2022
% 0.71/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31972_n011.cluster.edu".
% 0.71/0.99 ============================== end of head ===========================
% 0.71/0.99
% 0.71/0.99 ============================== INPUT =================================
% 0.71/0.99
% 0.71/0.99 % Reading from file /tmp/Prover9_31972_n011.cluster.edu
% 0.71/0.99
% 0.71/0.99 set(prolog_style_variables).
% 0.71/0.99 set(auto2).
% 0.71/0.99 % set(auto2) -> set(auto).
% 0.71/0.99 % set(auto) -> set(auto_inference).
% 0.71/0.99 % set(auto) -> set(auto_setup).
% 0.71/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.99 % set(auto) -> set(auto_limits).
% 0.71/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.99 % set(auto) -> set(auto_denials).
% 0.71/0.99 % set(auto) -> set(auto_process).
% 0.71/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.99 % set(auto2) -> assign(stats, some).
% 0.71/0.99 % set(auto2) -> clear(echo_input).
% 0.71/0.99 % set(auto2) -> set(quiet).
% 0.71/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.99 % set(auto2) -> clear(print_given).
% 0.71/0.99 assign(lrs_ticks,-1).
% 0.71/0.99 assign(sos_limit,10000).
% 0.71/0.99 assign(order,kbo).
% 0.71/0.99 set(lex_order_vars).
% 0.71/0.99 clear(print_given).
% 0.71/0.99
% 0.71/0.99 % formulas(sos). % not echoed (21 formulas)
% 0.71/0.99
% 0.71/0.99 ============================== end of input ==========================
% 0.71/0.99
% 0.71/0.99 % From the command line: assign(max_seconds, 300).
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.99
% 0.71/0.99 % Formulas that are not ordinary clauses:
% 0.71/0.99
% 0.71/0.99 ============================== end of process non-clausal formulas ===
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.99
% 0.71/0.99 ============================== PREDICATE ELIMINATION =================
% 0.71/0.99
% 0.71/0.99 ============================== end predicate elimination =============
% 0.71/0.99
% 0.71/0.99 Auto_denials: (non-Horn, no changes).
% 0.71/0.99
% 0.71/0.99 Term ordering decisions:
% 0.71/0.99 Function symbol KB weights: c17=1. c14=1. c15=1. c16=1. f3=1. f8=1. f10=1. f5=1. f6=1. f7=1. f9=1.
% 0.71/0.99
% 0.71/0.99 ============================== end of process initial clauses ========
% 0.71/0.99
% 0.71/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.71/0.99
% 0.71/0.99 ============================== end of clauses for search =============
% 0.71/0.99
% 0.71/0.99 ============================== SEARCH ================================
% 0.71/0.99
% 0.71/0.99 % Starting search at 0.01 seconds.
% 0.71/0.99
% 0.71/0.99 ============================== PROOF =================================
% 0.71/0.99 % SZS status Unsatisfiable
% 0.71/0.99 % SZS output start Refutation
% 0.71/0.99
% 0.71/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.71/0.99 % Length of proof is 13.
% 0.71/0.99 % Level of proof is 3.
% 0.71/0.99 % Maximum clause weight is 15.000.
% 0.71/0.99 % Given clauses 27.
% 0.71/0.99
% 0.71/0.99 1 p12(c15) # label(c15_is_p12_1) # label(negated_conjecture). [assumption].
% 0.71/0.99 3 p2(A,A) # label(p2_3) # label(negated_conjecture). [assumption].
% 0.71/0.99 4 p11(A,f3(f8(B),f3(f8(A),f5(f6(f7(c14)))))) # label(p11_16) # label(negated_conjecture). [assumption].
% 0.71/0.99 5 -p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))) # label(not_p11_19) # label(negated_conjecture). [assumption].
% 0.71/0.99 15 p2(A,B) | -p2(C,A) | -p2(C,B) # label(p2_13) # label(negated_conjecture). [assumption].
% 0.71/0.99 16 p11(A,c16) | p2(A,f9(c17)) | -p12(A) # label(p11_14) # label(negated_conjecture). [assumption].
% 0.71/0.99 18 p11(A,B) | -p2(C,A) | -p2(D,B) | -p11(C,D) # label(p11_17) # label(negated_conjecture). [assumption].
% 0.71/0.99 21 p11(A,f3(f8(B),f3(f8(C),f5(f6(f7(c14)))))) | -p11(A,B) # label(p11_21) # label(negated_conjecture). [assumption].
% 0.71/0.99 28 p11(c15,c16) | p2(c15,f9(c17)). [resolve(16,c,1,a)].
% 0.71/0.99 31 -p2(f9(c17),c15). [ur(18,a,5,a,c,3,a,d,4,a)].
% 0.71/0.99 36 -p11(c15,c16). [ur(21,a,5,a)].
% 0.71/0.99 37 p2(c15,f9(c17)). [back_unit_del(28),unit_del(a,36)].
% 0.71/0.99 47 $F. [ur(15,a,31,a,c,3,a),unit_del(a,37)].
% 0.71/0.99
% 0.71/0.99 % SZS output end Refutation
% 0.71/0.99 ============================== end of proof ==========================
% 0.71/0.99
% 0.71/0.99 ============================== STATISTICS ============================
% 0.71/0.99
% 0.71/0.99 Given=27. Generated=61. Kept=46. proofs=1.
% 0.71/0.99 Usable=27. Sos=18. Demods=0. Limbo=0, Disabled=22. Hints=0.
% 0.71/0.99 Megabytes=0.08.
% 0.71/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.71/0.99
% 0.71/0.99 ============================== end of statistics =====================
% 0.71/0.99
% 0.71/0.99 ============================== end of search =========================
% 0.71/0.99
% 0.71/0.99 THEOREM PROVED
% 0.71/0.99 % SZS status Unsatisfiable
% 0.71/0.99
% 0.71/0.99 Exiting with 1 proof.
% 0.71/0.99
% 0.71/0.99 Process 32126 exit (max_proofs) Tue Jul 12 02:03:28 2022
% 0.71/0.99 Prover9 interrupted
%------------------------------------------------------------------------------