TSTP Solution File: SYN652-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN652-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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:40 EDT 2022
% Result : Unsatisfiable 0.44s 1.00s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN652-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n010.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 23:13:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.00 ============================== Prover9 ===============================
% 0.44/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.00 Process 26599 was started by sandbox2 on n010.cluster.edu,
% 0.44/1.00 Mon Jul 11 23:13:45 2022
% 0.44/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26446_n010.cluster.edu".
% 0.44/1.00 ============================== end of head ===========================
% 0.44/1.00
% 0.44/1.00 ============================== INPUT =================================
% 0.44/1.00
% 0.44/1.00 % Reading from file /tmp/Prover9_26446_n010.cluster.edu
% 0.44/1.00
% 0.44/1.00 set(prolog_style_variables).
% 0.44/1.00 set(auto2).
% 0.44/1.00 % set(auto2) -> set(auto).
% 0.44/1.00 % set(auto) -> set(auto_inference).
% 0.44/1.00 % set(auto) -> set(auto_setup).
% 0.44/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.00 % set(auto) -> set(auto_limits).
% 0.44/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.00 % set(auto) -> set(auto_denials).
% 0.44/1.00 % set(auto) -> set(auto_process).
% 0.44/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.00 % set(auto2) -> assign(stats, some).
% 0.44/1.00 % set(auto2) -> clear(echo_input).
% 0.44/1.00 % set(auto2) -> set(quiet).
% 0.44/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.00 % set(auto2) -> clear(print_given).
% 0.44/1.00 assign(lrs_ticks,-1).
% 0.44/1.00 assign(sos_limit,10000).
% 0.44/1.00 assign(order,kbo).
% 0.44/1.00 set(lex_order_vars).
% 0.44/1.00 clear(print_given).
% 0.44/1.00
% 0.44/1.00 % formulas(sos). % not echoed (47 formulas)
% 0.44/1.00
% 0.44/1.00 ============================== end of input ==========================
% 0.44/1.00
% 0.44/1.00 % From the command line: assign(max_seconds, 300).
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.00
% 0.44/1.00 % Formulas that are not ordinary clauses:
% 0.44/1.00
% 0.44/1.00 ============================== end of process non-clausal formulas ===
% 0.44/1.00
% 0.44/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.00
% 0.44/1.00 ============================== PREDICATE ELIMINATION =================
% 0.44/1.00
% 0.44/1.00 ============================== end predicate elimination =============
% 0.44/1.00
% 0.44/1.00 Auto_denials:
% 0.44/1.00 % copying label not_p4_18 to answer in negative clause
% 0.44/1.00
% 0.44/1.00 Term ordering decisions:
% 0.44/1.00 Function symbol KB weights: c36=1. c28=1. c29=1. c30=1. c31=1. c32=1. c35=1. c37=1. c33=1. c34=1. c38=1. f5=1. f17=1. f10=1. f13=1. f15=1. f20=1. f26=1. f8=1. f22=1. f24=1.
% 0.44/1.00
% 0.44/1.00 ============================== end of process initial clauses ========
% 0.44/1.00
% 0.44/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.00
% 0.44/1.00 ============================== end of clauses for search =============
% 0.44/1.00
% 0.44/1.00 ============================== SEARCH ================================
% 0.44/1.00
% 0.44/1.00 % Starting search at 0.01 seconds.
% 0.44/1.00
% 0.44/1.00 ============================== PROOF =================================
% 0.44/1.00 % SZS status Unsatisfiable
% 0.44/1.00 % SZS output start Refutation
% 0.44/1.00
% 0.44/1.00 % Proof 1 at 0.02 (+ 0.00) seconds: not_p4_18.
% 0.44/1.00 % Length of proof is 16.
% 0.44/1.00 % Level of proof is 4.
% 0.44/1.00 % Maximum clause weight is 16.000.
% 0.44/1.00 % Given clauses 62.
% 0.44/1.00
% 0.44/1.00 5 p4(A,A) # label(p4_5) # label(negated_conjecture). [assumption].
% 0.44/1.00 14 p14(A,A) # label(p14_14) # label(negated_conjecture). [assumption].
% 0.44/1.00 16 p4(c34,f5(c35,c32)) # label(p4_16) # label(negated_conjecture). [assumption].
% 0.44/1.00 17 p27(f8(f10(c28,f13(c29,c30)),c32),c33) # label(p27_17) # label(negated_conjecture). [assumption].
% 0.44/1.00 18 p4(f15(f17(c36,A),f5(c35,B)),f5(A,B)) # label(p4_34) # label(negated_conjecture). [assumption].
% 0.44/1.00 20 -p4(f5(c31,c33),f15(f17(c36,c31),c34)) # label(not_p4_18) # label(negated_conjecture) # answer(not_p4_18). [assumption].
% 0.44/1.00 25 p4(A,B) | -p4(C,A) | -p4(C,B) # label(p4_23) # label(negated_conjecture). [assumption].
% 0.44/1.00 42 p4(f15(A,B),f15(C,D)) | -p14(A,C) | -p4(B,D) # label(p4_41) # label(negated_conjecture). [assumption].
% 0.44/1.00 47 p4(f5(c31,A),f5(c31,B)) | -p27(f8(f10(c28,f13(c29,c30)),A),B) # label(p4_46) # label(negated_conjecture). [assumption].
% 0.44/1.00 48 -p4(A,f5(c31,c33)) | -p4(A,f15(f17(c36,c31),c34)) # answer(not_p4_18). [resolve(25,a,20,a)].
% 0.44/1.00 51 p4(f5(c35,c32),c34). [ur(25,b,16,a,c,5,a)].
% 0.44/1.00 57 p4(f5(c31,c32),f5(c31,c33)). [ur(47,b,17,a)].
% 0.44/1.00 70 p4(f15(A,f5(c35,c32)),f15(A,c34)). [ur(42,b,14,a,c,51,a)].
% 0.44/1.00 72 -p4(f5(c31,c32),f15(f17(c36,c31),c34)) # answer(not_p4_18). [resolve(57,a,48,a)].
% 0.44/1.00 90 p4(f5(A,c32),f15(f17(c36,A),c34)). [ur(25,b,18,a,c,70,a)].
% 0.44/1.00 91 $F # answer(not_p4_18). [resolve(90,a,72,a)].
% 0.44/1.00
% 0.44/1.00 % SZS output end Refutation
% 0.44/1.00 ============================== end of proof ==========================
% 0.44/1.00
% 0.44/1.00 ============================== STATISTICS ============================
% 0.44/1.00
% 0.44/1.00 Given=62. Generated=173. Kept=90. proofs=1.
% 0.44/1.00 Usable=62. Sos=23. Demods=0. Limbo=2, Disabled=49. Hints=0.
% 0.44/1.00 Megabytes=0.17.
% 0.44/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.44/1.00
% 0.44/1.00 ============================== end of statistics =====================
% 0.44/1.00
% 0.44/1.00 ============================== end of search =========================
% 0.44/1.00
% 0.44/1.00 THEOREM PROVED
% 0.44/1.00 % SZS status Unsatisfiable
% 0.44/1.00
% 0.44/1.00 Exiting with 1 proof.
% 0.44/1.00
% 0.44/1.00 Process 26599 exit (max_proofs) Mon Jul 11 23:13:45 2022
% 0.44/1.00 Prover9 interrupted
%------------------------------------------------------------------------------