TSTP Solution File: SYN656-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN656-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:41 EDT 2022
% Result : Unsatisfiable 0.43s 0.99s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN656-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 14:13:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/0.99 ============================== Prover9 ===============================
% 0.43/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.99 Process 5832 was started by sandbox on n008.cluster.edu,
% 0.43/0.99 Mon Jul 11 14:13:24 2022
% 0.43/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_5675_n008.cluster.edu".
% 0.43/0.99 ============================== end of head ===========================
% 0.43/0.99
% 0.43/0.99 ============================== INPUT =================================
% 0.43/0.99
% 0.43/0.99 % Reading from file /tmp/Prover9_5675_n008.cluster.edu
% 0.43/0.99
% 0.43/0.99 set(prolog_style_variables).
% 0.43/0.99 set(auto2).
% 0.43/0.99 % set(auto2) -> set(auto).
% 0.43/0.99 % set(auto) -> set(auto_inference).
% 0.43/0.99 % set(auto) -> set(auto_setup).
% 0.43/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.99 % set(auto) -> set(auto_limits).
% 0.43/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.99 % set(auto) -> set(auto_denials).
% 0.43/0.99 % set(auto) -> set(auto_process).
% 0.43/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.99 % set(auto2) -> assign(stats, some).
% 0.43/0.99 % set(auto2) -> clear(echo_input).
% 0.43/0.99 % set(auto2) -> set(quiet).
% 0.43/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.99 % set(auto2) -> clear(print_given).
% 0.43/0.99 assign(lrs_ticks,-1).
% 0.43/0.99 assign(sos_limit,10000).
% 0.43/0.99 assign(order,kbo).
% 0.43/0.99 set(lex_order_vars).
% 0.43/0.99 clear(print_given).
% 0.43/0.99
% 0.43/0.99 % formulas(sos). % not echoed (49 formulas)
% 0.43/0.99
% 0.43/0.99 ============================== end of input ==========================
% 0.43/0.99
% 0.43/0.99 % From the command line: assign(max_seconds, 300).
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.99
% 0.43/0.99 % Formulas that are not ordinary clauses:
% 0.43/0.99
% 0.43/0.99 ============================== end of process non-clausal formulas ===
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99
% 0.43/0.99 ============================== PREDICATE ELIMINATION =================
% 0.43/0.99
% 0.43/0.99 ============================== end predicate elimination =============
% 0.43/0.99
% 0.43/0.99 Auto_denials: (non-Horn, no changes).
% 0.43/0.99
% 0.43/0.99 Term ordering decisions:
% 0.43/0.99 Function symbol KB weights: c28=1. c31=1. c34=1. c27=1. c29=1. c30=1. c33=1. c36=1. c26=1. c32=1. c35=1. f5=1. f7=1. f13=1. f15=1. f10=1. f17=1. f19=1. f21=1. f23=1.
% 0.43/0.99
% 0.43/0.99 ============================== end of process initial clauses ========
% 0.43/0.99
% 0.43/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.99
% 0.43/0.99 ============================== end of clauses for search =============
% 0.43/0.99
% 0.43/0.99 ============================== SEARCH ================================
% 0.43/0.99
% 0.43/0.99 % Starting search at 0.01 seconds.
% 0.43/0.99
% 0.43/0.99 ============================== PROOF =================================
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99 % SZS output start Refutation
% 0.43/0.99
% 0.43/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/0.99 % Length of proof is 15.
% 0.43/0.99 % Level of proof is 4.
% 0.43/0.99 % Maximum clause weight is 26.000.
% 0.43/0.99 % Given clauses 80.
% 0.43/0.99
% 0.43/0.99 5 p4(A,A) # label(p4_5) # label(negated_conjecture). [assumption].
% 0.43/0.99 6 p3(A,A) # label(p3_6) # label(negated_conjecture). [assumption].
% 0.43/0.99 16 p25(f5(c29,f13(c31,f15(c32,A))),f13(c31,A)) # label(p25_31) # label(negated_conjecture). [assumption].
% 0.43/0.99 17 p3(f13(c31,c34),f13(c31,f15(f17(c33,c34),A))) | p25(f5(f7(c28,c29),f13(c31,f15(f17(c33,c34),A))),f13(c31,c34)) # label(p3_49) # label(negated_conjecture). [assumption].
% 0.43/0.99 19 -p25(f5(f7(c28,c29),f13(c31,f15(c32,f15(f17(c33,c34),c35)))),f13(c31,c34)) # label(not_p25_45) # label(negated_conjecture). [assumption].
% 0.43/0.99 25 p3(A,B) | -p3(C,A) | -p3(C,B) # label(p3_22) # label(negated_conjecture). [assumption].
% 0.43/0.99 34 p25(f5(f7(c28,A),B),C) | -p25(f5(A,B),C) # label(p25_32) # label(negated_conjecture). [assumption].
% 0.43/0.99 36 p25(A,B) | -p3(C,B) | -p4(D,A) | -p25(D,C) # label(p25_35) # label(negated_conjecture). [assumption].
% 0.43/0.99 46 p25(f5(f7(c28,A),B),C) | -p25(f5(A,B),D) | -p25(f5(f7(c28,A),D),C) # label(p25_46) # label(negated_conjecture). [assumption].
% 0.43/0.99 56 p3(A,B) | -p3(B,A). [resolve(25,c,6,a)].
% 0.43/0.99 64 p25(f5(f7(c28,c29),f13(c31,f15(c32,A))),f13(c31,A)). [resolve(34,b,16,a)].
% 0.43/0.99 82 -p25(f5(f7(c28,c29),f13(c31,f15(f17(c33,c34),c35))),f13(c31,c34)). [ur(46,a,19,a,b,16,a)].
% 0.43/0.99 105 -p3(f13(c31,f15(f17(c33,c34),c35)),f13(c31,c34)). [ur(36,a,19,a,c,5,a,d,64,a)].
% 0.43/0.99 111 -p3(f13(c31,c34),f13(c31,f15(f17(c33,c34),c35))). [ur(56,a,105,a)].
% 0.43/0.99 114 $F. [resolve(111,a,17,a),unit_del(a,82)].
% 0.43/0.99
% 0.43/0.99 % SZS output end Refutation
% 0.43/0.99 ============================== end of proof ==========================
% 0.43/0.99
% 0.43/0.99 ============================== STATISTICS ============================
% 0.43/0.99
% 0.43/0.99 Given=80. Generated=205. Kept=113. proofs=1.
% 0.43/0.99 Usable=80. Sos=33. Demods=0. Limbo=0, Disabled=49. Hints=0.
% 0.43/0.99 Megabytes=0.22.
% 0.43/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of statistics =====================
% 0.43/0.99
% 0.43/0.99 ============================== end of search =========================
% 0.43/0.99
% 0.43/0.99 THEOREM PROVED
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99
% 0.43/0.99 Exiting with 1 proof.
% 0.43/0.99
% 0.43/0.99 Process 5832 exit (max_proofs) Mon Jul 11 14:13:24 2022
% 0.43/0.99 Prover9 interrupted
%------------------------------------------------------------------------------