TSTP Solution File: SYN567-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN567-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:08 EDT 2022
% Result : Unsatisfiable 0.45s 1.02s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN567-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 13:51:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.02 ============================== Prover9 ===============================
% 0.45/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.02 Process 27009 was started by sandbox2 on n026.cluster.edu,
% 0.45/1.02 Mon Jul 11 13:51:28 2022
% 0.45/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_26759_n026.cluster.edu".
% 0.45/1.02 ============================== end of head ===========================
% 0.45/1.02
% 0.45/1.02 ============================== INPUT =================================
% 0.45/1.02
% 0.45/1.02 % Reading from file /tmp/Prover9_26759_n026.cluster.edu
% 0.45/1.02
% 0.45/1.02 set(prolog_style_variables).
% 0.45/1.02 set(auto2).
% 0.45/1.02 % set(auto2) -> set(auto).
% 0.45/1.02 % set(auto) -> set(auto_inference).
% 0.45/1.02 % set(auto) -> set(auto_setup).
% 0.45/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.45/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.02 % set(auto) -> set(auto_limits).
% 0.45/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.02 % set(auto) -> set(auto_denials).
% 0.45/1.02 % set(auto) -> set(auto_process).
% 0.45/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.45/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.45/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.45/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.45/1.02 % set(auto2) -> assign(stats, some).
% 0.45/1.02 % set(auto2) -> clear(echo_input).
% 0.45/1.02 % set(auto2) -> set(quiet).
% 0.45/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.02 % set(auto2) -> clear(print_given).
% 0.45/1.02 assign(lrs_ticks,-1).
% 0.45/1.02 assign(sos_limit,10000).
% 0.45/1.02 assign(order,kbo).
% 0.45/1.02 set(lex_order_vars).
% 0.45/1.02 clear(print_given).
% 0.45/1.02
% 0.45/1.02 % formulas(sos). % not echoed (19 formulas)
% 0.45/1.02
% 0.45/1.02 ============================== end of input ==========================
% 0.45/1.02
% 0.45/1.02 % From the command line: assign(max_seconds, 300).
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.02
% 0.45/1.02 % Formulas that are not ordinary clauses:
% 0.45/1.02
% 0.45/1.02 ============================== end of process non-clausal formulas ===
% 0.45/1.02
% 0.45/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.02
% 0.45/1.02 ============================== PREDICATE ELIMINATION =================
% 0.45/1.02
% 0.45/1.02 ============================== end predicate elimination =============
% 0.45/1.02
% 0.45/1.02 Auto_denials: (non-Horn, no changes).
% 0.45/1.02
% 0.45/1.02 Term ordering decisions:
% 0.45/1.02 Function symbol KB weights: c10=1. c9=1. f7=1. f3=1. f4=1. f6=1. f8=1.
% 0.45/1.02
% 0.45/1.02 ============================== end of process initial clauses ========
% 0.45/1.02
% 0.45/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.02
% 0.45/1.02 ============================== end of clauses for search =============
% 0.45/1.02
% 0.45/1.02 ============================== SEARCH ================================
% 0.45/1.02
% 0.45/1.02 % Starting search at 0.01 seconds.
% 0.45/1.02
% 0.45/1.02 ============================== PROOF =================================
% 0.45/1.02 % SZS status Unsatisfiable
% 0.45/1.02 % SZS output start Refutation
% 0.45/1.02
% 0.45/1.02 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.45/1.02 % Length of proof is 9.
% 0.45/1.03 % Level of proof is 2.
% 0.45/1.03 % Maximum clause weight is 31.000.
% 0.45/1.03 % Given clauses 19.
% 0.45/1.03
% 0.45/1.03 3 p5(f8(f6(A)),A) # label(p5_3) # label(negated_conjecture). [assumption].
% 0.45/1.03 4 -p2(f6(c9),f3(f4(c10))) # label(not_p2_4) # label(negated_conjecture). [assumption].
% 0.45/1.03 5 -p2(f6(c9),f3(f7(f4(c10)))) # label(not_p2_5) # label(negated_conjecture). [assumption].
% 0.45/1.03 6 -p2(f6(c9),f3(f7(f7(f4(c10))))) # label(not_p2_6) # label(negated_conjecture). [assumption].
% 0.45/1.03 7 -p2(f6(c9),f3(f7(f7(f7(f4(c10)))))) # label(not_p2_12) # label(negated_conjecture). [assumption].
% 0.45/1.03 11 p2(f6(A),f6(B)) | -p5(A,B) # label(p2_10) # label(negated_conjecture). [assumption].
% 0.45/1.03 19 p2(A,f3(f4(c10))) | p2(A,f3(f7(f4(c10)))) | p2(A,f3(f7(f7(f4(c10))))) | p2(A,f3(f7(f7(f7(f4(c10)))))) | -p2(f6(f8(A)),A) # label(p2_19) # label(negated_conjecture). [assumption].
% 0.45/1.03 20 p2(f6(f8(f6(A))),f6(A)). [resolve(11,b,3,a)].
% 0.45/1.03 33 $F. [ur(19,a,4,a,b,5,a,c,6,a,d,7,a),unit_del(a,20)].
% 0.45/1.03
% 0.45/1.03 % SZS output end Refutation
% 0.45/1.03 ============================== end of proof ==========================
% 0.45/1.03
% 0.45/1.03 ============================== STATISTICS ============================
% 0.45/1.03
% 0.45/1.03 Given=19. Generated=46. Kept=32. proofs=1.
% 0.45/1.03 Usable=19. Sos=13. Demods=0. Limbo=0, Disabled=19. Hints=0.
% 0.45/1.03 Megabytes=0.06.
% 0.45/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/1.03
% 0.45/1.03 ============================== end of statistics =====================
% 0.45/1.03
% 0.45/1.03 ============================== end of search =========================
% 0.45/1.03
% 0.45/1.03 THEOREM PROVED
% 0.45/1.03 % SZS status Unsatisfiable
% 0.45/1.03
% 0.45/1.03 Exiting with 1 proof.
% 0.45/1.03
% 0.45/1.03 Process 27009 exit (max_proofs) Mon Jul 11 13:51:28 2022
% 0.45/1.03 Prover9 interrupted
%------------------------------------------------------------------------------