TSTP Solution File: SYN564-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN564-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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:07 EDT 2022
% Result : Unsatisfiable 0.68s 1.00s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN564-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 : n029.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 : Mon Jul 11 20:47:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/1.00 ============================== Prover9 ===============================
% 0.68/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.68/1.00 Process 30096 was started by sandbox2 on n029.cluster.edu,
% 0.68/1.00 Mon Jul 11 20:47:18 2022
% 0.68/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29942_n029.cluster.edu".
% 0.68/1.00 ============================== end of head ===========================
% 0.68/1.00
% 0.68/1.00 ============================== INPUT =================================
% 0.68/1.00
% 0.68/1.00 % Reading from file /tmp/Prover9_29942_n029.cluster.edu
% 0.68/1.00
% 0.68/1.00 set(prolog_style_variables).
% 0.68/1.00 set(auto2).
% 0.68/1.00 % set(auto2) -> set(auto).
% 0.68/1.00 % set(auto) -> set(auto_inference).
% 0.68/1.00 % set(auto) -> set(auto_setup).
% 0.68/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.68/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.68/1.00 % set(auto) -> set(auto_limits).
% 0.68/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.68/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.68/1.00 % set(auto) -> set(auto_denials).
% 0.68/1.00 % set(auto) -> set(auto_process).
% 0.68/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.68/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.68/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.68/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.68/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.68/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.68/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.68/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.68/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.68/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.68/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.68/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.68/1.00 % set(auto2) -> assign(stats, some).
% 0.68/1.00 % set(auto2) -> clear(echo_input).
% 0.68/1.00 % set(auto2) -> set(quiet).
% 0.68/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.68/1.00 % set(auto2) -> clear(print_given).
% 0.68/1.00 assign(lrs_ticks,-1).
% 0.68/1.00 assign(sos_limit,10000).
% 0.68/1.00 assign(order,kbo).
% 0.68/1.00 set(lex_order_vars).
% 0.68/1.00 clear(print_given).
% 0.68/1.00
% 0.68/1.00 % formulas(sos). % not echoed (18 formulas)
% 0.68/1.00
% 0.68/1.00 ============================== end of input ==========================
% 0.68/1.00
% 0.68/1.00 % From the command line: assign(max_seconds, 300).
% 0.68/1.00
% 0.68/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.68/1.00
% 0.68/1.00 % Formulas that are not ordinary clauses:
% 0.68/1.00
% 0.68/1.00 ============================== end of process non-clausal formulas ===
% 0.68/1.00
% 0.68/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.68/1.00
% 0.68/1.00 ============================== PREDICATE ELIMINATION =================
% 0.68/1.00
% 0.68/1.00 ============================== end predicate elimination =============
% 0.68/1.00
% 0.68/1.00 Auto_denials:
% 0.68/1.00 % copying label not_p10_11 to answer in negative clause
% 0.68/1.00
% 0.68/1.00 Term ordering decisions:
% 0.68/1.00 Function symbol KB weights: c11=1. c12=1. f3=1. f8=1. f6=1. f9=1. f5=1. f7=1.
% 0.68/1.00
% 0.68/1.00 ============================== end of process initial clauses ========
% 0.68/1.00
% 0.68/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.68/1.00
% 0.68/1.00 ============================== end of clauses for search =============
% 0.68/1.00
% 0.68/1.00 ============================== SEARCH ================================
% 0.68/1.00
% 0.68/1.00 % Starting search at 0.01 seconds.
% 0.68/1.00
% 0.68/1.00 ============================== PROOF =================================
% 0.68/1.00 % SZS status Unsatisfiable
% 0.68/1.00 % SZS output start Refutation
% 0.68/1.00
% 0.68/1.00 % Proof 1 at 0.06 (+ 0.00) seconds: not_p10_11.
% 0.68/1.00 % Length of proof is 17.
% 0.68/1.00 % Level of proof is 3.
% 0.68/1.00 % Maximum clause weight is 16.000.
% 0.68/1.00 % Given clauses 62.
% 0.68/1.00
% 0.68/1.00 1 p2(A,A) # label(p2_1) # label(negated_conjecture). [assumption].
% 0.68/1.00 3 p2(f5(f7(A)),f5(A)) # label(p2_3) # label(negated_conjecture). [assumption].
% 0.68/1.00 4 p4(f8(A,B),f6(A,f7(B))) # label(p4_4) # label(negated_conjecture). [assumption].
% 0.68/1.00 6 p10(f5(A),f3(f5(f6(A,B)),f5(B))) # label(p10_10) # label(negated_conjecture). [assumption].
% 0.68/1.00 7 -p10(f9(f5(c11),f5(c12)),f5(f8(c11,c12))) # label(not_p10_11) # label(negated_conjecture) # answer(not_p10_11). [assumption].
% 0.68/1.00 8 p2(f5(A),f5(B)) | -p4(A,B) # label(p2_6) # label(negated_conjecture). [assumption].
% 0.68/1.00 10 p2(A,B) | -p2(C,A) | -p2(C,B) # label(p2_8) # label(negated_conjecture). [assumption].
% 0.68/1.00 13 p10(f9(A,B),C) | -p10(A,f3(C,B)) # label(p10_13) # label(negated_conjecture). [assumption].
% 0.68/1.00 14 p10(A,B) | -p2(C,A) | -p2(D,B) | -p10(C,D) # label(p10_14) # label(negated_conjecture). [assumption].
% 0.68/1.00 17 p2(f9(A,B),f9(C,D)) | -p2(A,C) | -p2(B,D) # label(p2_17) # label(negated_conjecture). [assumption].
% 0.68/1.00 20 p2(f5(f8(A,B)),f5(f6(A,f7(B)))). [ur(8,b,4,a)].
% 0.68/1.00 27 p10(f9(f5(A),f5(B)),f5(f6(A,B))). [ur(13,b,6,a)].
% 0.68/1.00 28 -p2(A,f9(f5(c11),f5(c12))) | -p2(B,f5(f8(c11,c12))) | -p10(A,B) # answer(not_p10_11). [resolve(14,a,7,a)].
% 0.68/1.00 44 p2(f9(A,f5(f7(B))),f9(A,f5(B))). [ur(17,b,1,a,c,3,a)].
% 0.68/1.00 201 p2(f5(f6(A,f7(B))),f5(f8(A,B))). [ur(10,b,20,a,c,1,a)].
% 0.68/1.00 1066 -p2(f5(f6(c11,f7(c12))),f5(f8(c11,c12))) # answer(not_p10_11). [ur(28,a,44,a,c,27,a)].
% 0.68/1.00 1067 $F # answer(not_p10_11). [resolve(1066,a,201,a)].
% 0.68/1.00
% 0.68/1.00 % SZS output end Refutation
% 0.68/1.00 ============================== end of proof ==========================
% 0.68/1.00
% 0.68/1.00 ============================== STATISTICS ============================
% 0.68/1.00
% 0.68/1.00 Given=62. Generated=1532. Kept=1066. proofs=1.
% 0.68/1.00 Usable=62. Sos=935. Demods=0. Limbo=68, Disabled=18. Hints=0.
% 0.68/1.00 Megabytes=0.88.
% 0.68/1.00 User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.68/1.00
% 0.68/1.00 ============================== end of statistics =====================
% 0.68/1.00
% 0.68/1.00 ============================== end of search =========================
% 0.68/1.00
% 0.68/1.00 THEOREM PROVED
% 0.68/1.00 % SZS status Unsatisfiable
% 0.68/1.00
% 0.68/1.00 Exiting with 1 proof.
% 0.68/1.00
% 0.68/1.00 Process 30096 exit (max_proofs) Mon Jul 11 20:47:18 2022
% 0.68/1.00 Prover9 interrupted
%------------------------------------------------------------------------------