TSTP Solution File: SYN657-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN657-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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:42 EDT 2022
% Result : Unsatisfiable 0.46s 1.03s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN657-1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n004.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 : Tue Jul 12 00:38:52 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.46/1.03 ============================== Prover9 ===============================
% 0.46/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.03 Process 24136 was started by sandbox on n004.cluster.edu,
% 0.46/1.03 Tue Jul 12 00:38:53 2022
% 0.46/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23983_n004.cluster.edu".
% 0.46/1.03 ============================== end of head ===========================
% 0.46/1.03
% 0.46/1.03 ============================== INPUT =================================
% 0.46/1.03
% 0.46/1.03 % Reading from file /tmp/Prover9_23983_n004.cluster.edu
% 0.46/1.03
% 0.46/1.03 set(prolog_style_variables).
% 0.46/1.03 set(auto2).
% 0.46/1.03 % set(auto2) -> set(auto).
% 0.46/1.03 % set(auto) -> set(auto_inference).
% 0.46/1.03 % set(auto) -> set(auto_setup).
% 0.46/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.03 % set(auto) -> set(auto_limits).
% 0.46/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.03 % set(auto) -> set(auto_denials).
% 0.46/1.03 % set(auto) -> set(auto_process).
% 0.46/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.03 % set(auto2) -> assign(stats, some).
% 0.46/1.03 % set(auto2) -> clear(echo_input).
% 0.46/1.03 % set(auto2) -> set(quiet).
% 0.46/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.03 % set(auto2) -> clear(print_given).
% 0.46/1.03 assign(lrs_ticks,-1).
% 0.46/1.03 assign(sos_limit,10000).
% 0.46/1.03 assign(order,kbo).
% 0.46/1.03 set(lex_order_vars).
% 0.46/1.03 clear(print_given).
% 0.46/1.03
% 0.46/1.03 % formulas(sos). % not echoed (50 formulas)
% 0.46/1.03
% 0.46/1.03 ============================== end of input ==========================
% 0.46/1.03
% 0.46/1.03 % From the command line: assign(max_seconds, 300).
% 0.46/1.03
% 0.46/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.03
% 0.46/1.03 % Formulas that are not ordinary clauses:
% 0.46/1.03
% 0.46/1.03 ============================== end of process non-clausal formulas ===
% 0.46/1.03
% 0.46/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.03
% 0.46/1.03 ============================== PREDICATE ELIMINATION =================
% 0.46/1.03
% 0.46/1.03 ============================== end predicate elimination =============
% 0.46/1.03
% 0.46/1.03 Auto_denials: (non-Horn, no changes).
% 0.46/1.03
% 0.46/1.03 Term ordering decisions:
% 0.46/1.03 Function symbol KB weights: c31=1. c28=1. c27=1. c29=1. c32=1. c33=1. c34=1. c35=1. c36=1. c30=1. f8=1. f9=1. f20=1. f16=1. f13=1. f14=1. f19=1. f18=1. f10=1. f21=1. f11=1. f12=1. f15=1. f5=1. f22=1.
% 0.46/1.03
% 0.46/1.03 ============================== end of process initial clauses ========
% 0.46/1.03
% 0.46/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.03
% 0.46/1.03 ============================== end of clauses for search =============
% 0.46/1.03
% 0.46/1.03 ============================== SEARCH ================================
% 0.46/1.03
% 0.46/1.03 % Starting search at 0.02 seconds.
% 0.46/1.03
% 0.46/1.03 ============================== PROOF =================================
% 0.46/1.03 % SZS status Unsatisfiable
% 0.46/1.03 % SZS output start Refutation
% 0.46/1.03
% 0.46/1.03 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.46/1.03 % Length of proof is 11.
% 0.46/1.03 % Level of proof is 4.
% 0.46/1.03 % Maximum clause weight is 26.000.
% 0.46/1.03 % Given clauses 117.
% 0.46/1.03
% 0.46/1.03 14 p6(f21(f8(A,f9(B,C))),B) # label(p6_15) # label(negated_conjecture). [assumption].
% 0.46/1.03 19 p6(f21(A),f10(c33)) | p25(f22(A,B,C),f18(A)) | p4(f5(A,c36,B),f5(A,c36,C)) # label(p6_48) # label(negated_conjecture). [assumption].
% 0.46/1.03 20 -p6(c28,f10(c33)) # label(not_p6_11) # label(negated_conjecture). [assumption].
% 0.46/1.03 22 -p4(f5(f8(c27,f9(c28,c29)),c36,c31),f5(f8(c27,f9(c28,c29)),c36,c34)) # label(not_p4_44) # label(negated_conjecture). [assumption].
% 0.46/1.03 32 p6(A,B) | -p6(C,A) | -p6(C,B) # label(p6_25) # label(negated_conjecture). [assumption].
% 0.46/1.03 46 p24(f19(f20(c31,c34)),f19(f20(c31,A))) | -p25(A,f18(f8(c27,f9(c28,c29)))) # label(p24_45) # label(negated_conjecture). [assumption].
% 0.46/1.03 49 p6(f21(A),f10(c33)) | p4(f5(A,c36,B),f5(A,c36,C)) | -p24(f19(f20(B,C)),f19(f20(B,f22(A,B,C)))) # label(p6_49) # label(negated_conjecture). [assumption].
% 0.46/1.03 76 -p6(f21(f8(A,f9(c28,B))),f10(c33)). [ur(32,a,20,a,b,14,a)].
% 0.46/1.03 164 -p24(f19(f20(c31,c34)),f19(f20(c31,f22(f8(c27,f9(c28,c29)),c31,c34)))). [ur(49,a,76,a,b,22,a)].
% 0.46/1.03 293 -p25(f22(f8(c27,f9(c28,c29)),c31,c34),f18(f8(c27,f9(c28,c29)))). [ur(46,a,164,a)].
% 0.46/1.03 296 $F. [resolve(293,a,19,b),unit_del(a,76),unit_del(b,22)].
% 0.46/1.03
% 0.46/1.03 % SZS output end Refutation
% 0.46/1.03 ============================== end of proof ==========================
% 0.46/1.03
% 0.46/1.03 ============================== STATISTICS ============================
% 0.46/1.03
% 0.46/1.03 Given=117. Generated=478. Kept=295. proofs=1.
% 0.46/1.03 Usable=117. Sos=177. Demods=0. Limbo=0, Disabled=51. Hints=0.
% 0.46/1.03 Megabytes=0.57.
% 0.46/1.03 User_CPU=0.04, System_CPU=0.00, Wall_clock=0.
% 0.46/1.03
% 0.46/1.03 ============================== end of statistics =====================
% 0.46/1.03
% 0.46/1.03 ============================== end of search =========================
% 0.46/1.03
% 0.46/1.03 THEOREM PROVED
% 0.46/1.03 % SZS status Unsatisfiable
% 0.46/1.03
% 0.46/1.03 Exiting with 1 proof.
% 0.46/1.03
% 0.46/1.03 Process 24136 exit (max_proofs) Tue Jul 12 00:38:53 2022
% 0.46/1.03 Prover9 interrupted
%------------------------------------------------------------------------------