TSTP Solution File: SYN608-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN608-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n013.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:23 EDT 2022
% Result : Unsatisfiable 0.46s 1.04s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN608-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jul 12 02:43:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.04 ============================== Prover9 ===============================
% 0.46/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.04 Process 31624 was started by sandbox2 on n013.cluster.edu,
% 0.46/1.04 Tue Jul 12 02:43:45 2022
% 0.46/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_31471_n013.cluster.edu".
% 0.46/1.04 ============================== end of head ===========================
% 0.46/1.04
% 0.46/1.04 ============================== INPUT =================================
% 0.46/1.04
% 0.46/1.04 % Reading from file /tmp/Prover9_31471_n013.cluster.edu
% 0.46/1.04
% 0.46/1.04 set(prolog_style_variables).
% 0.46/1.04 set(auto2).
% 0.46/1.04 % set(auto2) -> set(auto).
% 0.46/1.04 % set(auto) -> set(auto_inference).
% 0.46/1.04 % set(auto) -> set(auto_setup).
% 0.46/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.04 % set(auto) -> set(auto_limits).
% 0.46/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.04 % set(auto) -> set(auto_denials).
% 0.46/1.04 % set(auto) -> set(auto_process).
% 0.46/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.04 % set(auto2) -> assign(stats, some).
% 0.46/1.04 % set(auto2) -> clear(echo_input).
% 0.46/1.04 % set(auto2) -> set(quiet).
% 0.46/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.04 % set(auto2) -> clear(print_given).
% 0.46/1.04 assign(lrs_ticks,-1).
% 0.46/1.04 assign(sos_limit,10000).
% 0.46/1.04 assign(order,kbo).
% 0.46/1.04 set(lex_order_vars).
% 0.46/1.04 clear(print_given).
% 0.46/1.04
% 0.46/1.04 % formulas(sos). % not echoed (30 formulas)
% 0.46/1.04
% 0.46/1.04 ============================== end of input ==========================
% 0.46/1.04
% 0.46/1.04 % From the command line: assign(max_seconds, 300).
% 0.46/1.04
% 0.46/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.04
% 0.46/1.04 % Formulas that are not ordinary clauses:
% 0.46/1.04
% 0.46/1.04 ============================== end of process non-clausal formulas ===
% 0.46/1.04
% 0.46/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.04
% 0.46/1.04 ============================== PREDICATE ELIMINATION =================
% 0.46/1.04
% 0.46/1.04 ============================== end predicate elimination =============
% 0.46/1.04
% 0.46/1.04 Auto_denials: (non-Horn, no changes).
% 0.46/1.04
% 0.46/1.04 Term ordering decisions:
% 0.46/1.04 Function symbol KB weights: c20=1. c21=1. c22=1. c19=1. f12=1. f10=1. f11=1. f14=1. f7=1. f6=1. f4=1. f8=1. f15=1. f9=1. f13=1.
% 0.46/1.04
% 0.46/1.04 ============================== end of process initial clauses ========
% 0.46/1.04
% 0.46/1.04 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.04
% 0.46/1.04 ============================== end of clauses for search =============
% 0.46/1.04
% 0.46/1.04 ============================== SEARCH ================================
% 0.46/1.04
% 0.46/1.04 % Starting search at 0.01 seconds.
% 0.46/1.04
% 0.46/1.04 ============================== PROOF =================================
% 0.46/1.04 % SZS status Unsatisfiable
% 0.46/1.04 % SZS output start Refutation
% 0.46/1.04
% 0.46/1.04 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.46/1.04 % Length of proof is 14.
% 0.46/1.04 % Level of proof is 4.
% 0.46/1.04 % Maximum clause weight is 20.000.
% 0.46/1.04 % Given clauses 43.
% 0.46/1.04
% 0.46/1.04 1 p2(A,A) # label(p2_2) # label(negated_conjecture). [assumption].
% 0.46/1.04 3 p3(A,A) # label(p3_4) # label(negated_conjecture). [assumption].
% 0.46/1.04 4 p3(f12(c22,c21),f15(c22)) # label(p3_6) # label(negated_conjecture). [assumption].
% 0.46/1.04 7 p17(f9(f10(f14(f4(f9(c19)),c19),f15(c22))),f6(f7(f8(c20)))) # label(p17_27) # label(negated_conjecture). [assumption].
% 0.46/1.04 12 -p17(f9(f10(f14(f4(f9(c19)),c19),f12(A,c21))),f6(f7(f8(c20)))) # label(not_p17_29) # label(negated_conjecture). [assumption].
% 0.46/1.04 16 p2(f9(A),f9(B)) | -p3(A,B) # label(p2_12) # label(negated_conjecture). [assumption].
% 0.46/1.04 23 p3(A,B) | -p3(C,A) | -p3(C,B) # label(p3_19) # label(negated_conjecture). [assumption].
% 0.46/1.04 24 p17(A,B) | -p2(C,A) | -p2(D,B) | -p17(C,D) # label(p17_20) # label(negated_conjecture). [assumption].
% 0.46/1.04 27 p3(f10(A,B),f10(C,D)) | -p3(A,C) | -p3(B,D) # label(p3_24) # label(negated_conjecture). [assumption].
% 0.46/1.04 56 p3(A,B) | -p3(B,A). [resolve(23,c,3,a)].
% 0.46/1.04 59 -p2(f9(f10(f14(f4(f9(c19)),c19),f15(c22))),f9(f10(f14(f4(f9(c19)),c19),f12(A,c21)))). [ur(24,a,12,a,c,1,a,d,7,a)].
% 0.46/1.04 107 -p3(f10(f14(f4(f9(c19)),c19),f15(c22)),f10(f14(f4(f9(c19)),c19),f12(A,c21))). [ur(16,a,59,a)].
% 0.46/1.04 108 -p3(f15(c22),f12(A,c21)). [ur(27,a,107,a,b,3,a)].
% 0.46/1.04 114 $F. [resolve(56,b,4,a),unit_del(a,108)].
% 0.46/1.04
% 0.46/1.04 % SZS output end Refutation
% 0.46/1.04 ============================== end of proof ==========================
% 0.46/1.04
% 0.46/1.04 ============================== STATISTICS ============================
% 0.46/1.04
% 0.46/1.04 Given=43. Generated=145. Kept=112. proofs=1.
% 0.46/1.04 Usable=43. Sos=66. Demods=0. Limbo=3, Disabled=30. Hints=0.
% 0.46/1.04 Megabytes=0.19.
% 0.46/1.04 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.46/1.04
% 0.46/1.04 ============================== end of statistics =====================
% 0.46/1.04
% 0.46/1.04 ============================== end of search =========================
% 0.46/1.04
% 0.46/1.04 THEOREM PROVED
% 0.46/1.04 % SZS status Unsatisfiable
% 0.46/1.04
% 0.46/1.04 Exiting with 1 proof.
% 0.46/1.04
% 0.46/1.04 Process 31624 exit (max_proofs) Tue Jul 12 02:43:45 2022
% 0.46/1.04 Prover9 interrupted
%------------------------------------------------------------------------------