TSTP Solution File: SYN613-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN613-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:25 EDT 2022
% Result : Unsatisfiable 0.45s 0.96s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN613-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n008.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 06:21:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.45/0.96 ============================== Prover9 ===============================
% 0.45/0.96 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.96 Process 29399 was started by sandbox on n008.cluster.edu,
% 0.45/0.96 Tue Jul 12 06:21:09 2022
% 0.45/0.96 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29090_n008.cluster.edu".
% 0.45/0.96 ============================== end of head ===========================
% 0.45/0.96
% 0.45/0.96 ============================== INPUT =================================
% 0.45/0.96
% 0.45/0.96 % Reading from file /tmp/Prover9_29090_n008.cluster.edu
% 0.45/0.96
% 0.45/0.96 set(prolog_style_variables).
% 0.45/0.96 set(auto2).
% 0.45/0.96 % set(auto2) -> set(auto).
% 0.45/0.96 % set(auto) -> set(auto_inference).
% 0.45/0.96 % set(auto) -> set(auto_setup).
% 0.45/0.96 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.96 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.96 % set(auto) -> set(auto_limits).
% 0.45/0.96 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.96 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.96 % set(auto) -> set(auto_denials).
% 0.45/0.96 % set(auto) -> set(auto_process).
% 0.45/0.96 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.96 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.96 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.96 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.96 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.96 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.96 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.96 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.96 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.96 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.96 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.96 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.96 % set(auto2) -> assign(stats, some).
% 0.45/0.96 % set(auto2) -> clear(echo_input).
% 0.45/0.96 % set(auto2) -> set(quiet).
% 0.45/0.96 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.96 % set(auto2) -> clear(print_given).
% 0.45/0.96 assign(lrs_ticks,-1).
% 0.45/0.96 assign(sos_limit,10000).
% 0.45/0.96 assign(order,kbo).
% 0.45/0.96 set(lex_order_vars).
% 0.45/0.96 clear(print_given).
% 0.45/0.96
% 0.45/0.96 % formulas(sos). % not echoed (31 formulas)
% 0.45/0.96
% 0.45/0.96 ============================== end of input ==========================
% 0.45/0.96
% 0.45/0.96 % From the command line: assign(max_seconds, 300).
% 0.45/0.96
% 0.45/0.96 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.96
% 0.45/0.96 % Formulas that are not ordinary clauses:
% 0.45/0.96
% 0.45/0.96 ============================== end of process non-clausal formulas ===
% 0.45/0.96
% 0.45/0.96 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.96
% 0.45/0.96 ============================== PREDICATE ELIMINATION =================
% 0.45/0.96
% 0.45/0.96 ============================== end predicate elimination =============
% 0.45/0.96
% 0.45/0.96 Auto_denials: (non-Horn, no changes).
% 0.45/0.96
% 0.45/0.96 Term ordering decisions:
% 0.45/0.96 Function symbol KB weights: c21=1. c25=1. c19=1. c20=1. c23=1. c24=1. c22=1. f14=1. f7=1. f8=1. f9=1. f12=1. f13=1. f4=1. f15=1. f10=1.
% 0.45/0.96
% 0.45/0.96 ============================== end of process initial clauses ========
% 0.45/0.96
% 0.45/0.96 ============================== CLAUSES FOR SEARCH ====================
% 0.45/0.96
% 0.45/0.96 ============================== end of clauses for search =============
% 0.45/0.96
% 0.45/0.96 ============================== SEARCH ================================
% 0.45/0.96
% 0.45/0.96 % Starting search at 0.01 seconds.
% 0.45/0.96
% 0.45/0.96 ============================== PROOF =================================
% 0.45/0.96 % SZS status Unsatisfiable
% 0.45/0.96 % SZS output start Refutation
% 0.45/0.96
% 0.45/0.96 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.45/0.96 % Length of proof is 15.
% 0.45/0.96 % Level of proof is 3.
% 0.45/0.96 % Maximum clause weight is 17.000.
% 0.45/0.96 % Given clauses 39.
% 0.45/0.96
% 0.45/0.96 1 p11(A,A) # label(p11_1) # label(negated_conjecture). [assumption].
% 0.45/0.96 4 p3(A,A) # label(p3_4) # label(negated_conjecture). [assumption].
% 0.45/0.96 6 p16(A,A) # label(p16_6) # label(negated_conjecture). [assumption].
% 0.45/0.96 7 p11(c23,f12(f9(c21))) # label(p11_7) # label(negated_conjecture). [assumption].
% 0.45/0.96 8 p11(c24,f12(f9(c21))) # label(p11_8) # label(negated_conjecture). [assumption].
% 0.45/0.96 9 p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c24) # label(p17_21) # label(negated_conjecture). [assumption].
% 0.45/0.96 10 -p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c23) # label(not_p17_22) # label(negated_conjecture). [assumption].
% 0.45/0.96 17 p11(A,B) | -p11(C,A) | -p11(C,B) # label(p11_15) # label(negated_conjecture). [assumption].
% 0.45/0.96 29 p17(A,B,C) | -p3(D,B) | -p16(E,A) | -p11(F,C) | -p17(E,D,F) # label(p17_29) # label(negated_conjecture). [assumption].
% 0.45/0.96 43 p11(A,B) | -p11(B,A). [resolve(17,c,1,a)].
% 0.45/0.96 65 -p11(c24,c23). [ur(29,a,10,a,b,4,a,c,6,a,e,9,a)].
% 0.45/0.96 75 -p11(c23,c24). [ur(17,a,65,a,c,1,a)].
% 0.45/0.96 77 p11(f12(f9(c21)),c24). [resolve(43,b,8,a)].
% 0.45/0.96 78 p11(f12(f9(c21)),c23). [resolve(43,b,7,a)].
% 0.45/0.96 85 $F. [ur(17,a,75,a,c,77,a),unit_del(a,78)].
% 0.45/0.96
% 0.45/0.96 % SZS output end Refutation
% 0.45/0.96 ============================== end of proof ==========================
% 0.45/0.96
% 0.45/0.96 ============================== STATISTICS ============================
% 0.45/0.96
% 0.45/0.96 Given=39. Generated=114. Kept=84. proofs=1.
% 0.45/0.96 Usable=39. Sos=39. Demods=0. Limbo=6, Disabled=31. Hints=0.
% 0.45/0.96 Megabytes=0.13.
% 0.45/0.96 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.45/0.96
% 0.45/0.96 ============================== end of statistics =====================
% 0.45/0.96
% 0.45/0.96 ============================== end of search =========================
% 0.45/0.96
% 0.45/0.96 THEOREM PROVED
% 0.45/0.96 % SZS status Unsatisfiable
% 0.45/0.96
% 0.45/0.96 Exiting with 1 proof.
% 0.45/0.96
% 0.45/0.96 Process 29399 exit (max_proofs) Tue Jul 12 06:21:09 2022
% 0.45/0.96 Prover9 interrupted
%------------------------------------------------------------------------------