TSTP Solution File: SYN626-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN626-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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:30 EDT 2022
% Result : Unsatisfiable 0.45s 0.99s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN626-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n005.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 18:19:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/0.99 ============================== Prover9 ===============================
% 0.45/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.99 Process 11915 was started by sandbox on n005.cluster.edu,
% 0.45/0.99 Mon Jul 11 18:19:07 2022
% 0.45/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_11560_n005.cluster.edu".
% 0.45/0.99 ============================== end of head ===========================
% 0.45/0.99
% 0.45/0.99 ============================== INPUT =================================
% 0.45/0.99
% 0.45/0.99 % Reading from file /tmp/Prover9_11560_n005.cluster.edu
% 0.45/0.99
% 0.45/0.99 set(prolog_style_variables).
% 0.45/0.99 set(auto2).
% 0.45/0.99 % set(auto2) -> set(auto).
% 0.45/0.99 % set(auto) -> set(auto_inference).
% 0.45/0.99 % set(auto) -> set(auto_setup).
% 0.45/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.99 % set(auto) -> set(auto_limits).
% 0.45/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.99 % set(auto) -> set(auto_denials).
% 0.45/0.99 % set(auto) -> set(auto_process).
% 0.45/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.99 % set(auto2) -> assign(stats, some).
% 0.45/0.99 % set(auto2) -> clear(echo_input).
% 0.45/0.99 % set(auto2) -> set(quiet).
% 0.45/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.99 % set(auto2) -> clear(print_given).
% 0.45/0.99 assign(lrs_ticks,-1).
% 0.45/0.99 assign(sos_limit,10000).
% 0.45/0.99 assign(order,kbo).
% 0.45/0.99 set(lex_order_vars).
% 0.45/0.99 clear(print_given).
% 0.45/0.99
% 0.45/0.99 % formulas(sos). % not echoed (35 formulas)
% 0.45/0.99
% 0.45/0.99 ============================== end of input ==========================
% 0.45/0.99
% 0.45/0.99 % From the command line: assign(max_seconds, 300).
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.99
% 0.45/0.99 % Formulas that are not ordinary clauses:
% 0.45/0.99
% 0.45/0.99 ============================== end of process non-clausal formulas ===
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.99
% 0.45/0.99 ============================== PREDICATE ELIMINATION =================
% 0.45/0.99
% 0.45/0.99 ============================== end predicate elimination =============
% 0.45/0.99
% 0.45/0.99 Auto_denials: (non-Horn, no changes).
% 0.45/0.99
% 0.45/0.99 Term ordering decisions:
% 0.45/0.99 Function symbol KB weights: c22=1. c20=1. c21=1. c23=1. c24=1. f8=1. f9=1. f10=1. f12=1. f13=1. f4=1. f5=1.
% 0.45/0.99
% 0.45/0.99 ============================== end of process initial clauses ========
% 0.45/0.99
% 0.45/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.45/0.99
% 0.45/0.99 ============================== end of clauses for search =============
% 0.45/0.99
% 0.45/0.99 ============================== SEARCH ================================
% 0.45/0.99
% 0.45/0.99 % Starting search at 0.01 seconds.
% 0.45/0.99
% 0.45/0.99 ============================== PROOF =================================
% 0.45/0.99 % SZS status Unsatisfiable
% 0.45/0.99 % SZS output start Refutation
% 0.45/0.99
% 0.45/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.45/0.99 % Length of proof is 12.
% 0.45/0.99 % Level of proof is 3.
% 0.45/0.99 % Maximum clause weight is 15.000.
% 0.45/0.99 % Given clauses 39.
% 0.45/0.99
% 0.45/0.99 2 p7(A,A) # label(p7_2) # label(negated_conjecture). [assumption].
% 0.45/0.99 3 p6(A,A) # label(p6_3) # label(negated_conjecture). [assumption].
% 0.45/0.99 8 p15(c22,f8(f5(c20),f9(c23,c24))) # label(p15_9) # label(negated_conjecture). [assumption].
% 0.45/0.99 10 -p15(c22,f12(f13(f8(f5(c20),f9(c23,c24))))) # label(not_p15_24) # label(negated_conjecture). [assumption].
% 0.45/0.99 11 p16(A,B) | -p15(A,B) # label(p16_8) # label(negated_conjecture). [assumption].
% 0.45/0.99 17 p7(f12(f13(A)),A) | -p16(c22,A) # label(p7_15) # label(negated_conjecture). [assumption].
% 0.45/0.99 19 p7(A,B) | -p7(C,A) | -p7(C,B) # label(p7_17) # label(negated_conjecture). [assumption].
% 0.45/0.99 32 p15(A,B) | -p6(C,A) | -p7(D,B) | -p15(C,D) # label(p15_31) # label(negated_conjecture). [assumption].
% 0.45/0.99 38 p16(c22,f8(f5(c20),f9(c23,c24))). [resolve(11,b,8,a)].
% 0.45/0.99 52 -p7(f8(f5(c20),f9(c23,c24)),f12(f13(f8(f5(c20),f9(c23,c24))))). [ur(32,a,10,a,b,3,a,d,8,a)].
% 0.45/0.99 58 p7(f12(f13(f8(f5(c20),f9(c23,c24)))),f8(f5(c20),f9(c23,c24))). [resolve(38,a,17,b)].
% 0.45/0.99 59 $F. [ur(19,a,52,a,c,2,a),unit_del(a,58)].
% 0.45/0.99
% 0.45/0.99 % SZS output end Refutation
% 0.45/0.99 ============================== end of proof ==========================
% 0.45/0.99
% 0.45/0.99 ============================== STATISTICS ============================
% 0.45/0.99
% 0.45/0.99 Given=39. Generated=75. Kept=58. proofs=1.
% 0.45/0.99 Usable=39. Sos=19. Demods=0. Limbo=0, Disabled=35. Hints=0.
% 0.45/0.99 Megabytes=0.11.
% 0.45/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.45/0.99
% 0.45/0.99 ============================== end of statistics =====================
% 0.45/0.99
% 0.45/0.99 ============================== end of search =========================
% 0.45/0.99
% 0.45/0.99 THEOREM PROVED
% 0.45/0.99 % SZS status Unsatisfiable
% 0.45/0.99
% 0.45/0.99 Exiting with 1 proof.
% 0.45/0.99
% 0.45/0.99 Process 11915 exit (max_proofs) Mon Jul 11 18:19:07 2022
% 0.45/0.99 Prover9 interrupted
%------------------------------------------------------------------------------