TSTP Solution File: NUN076+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUN076+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 : Mon Jul 18 16:37:13 EDT 2022
% Result : Theorem 1.29s 1.58s
% Output : Refutation 1.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUN076+1 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.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 : Thu Jun 2 08:55:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.00 ============================== Prover9 ===============================
% 0.41/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.00 Process 21449 was started by sandbox on n020.cluster.edu,
% 0.41/1.00 Thu Jun 2 08:55:08 2022
% 0.41/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21295_n020.cluster.edu".
% 0.41/1.00 ============================== end of head ===========================
% 0.41/1.00
% 0.41/1.00 ============================== INPUT =================================
% 0.41/1.00
% 0.41/1.00 % Reading from file /tmp/Prover9_21295_n020.cluster.edu
% 0.41/1.00
% 0.41/1.00 set(prolog_style_variables).
% 0.41/1.00 set(auto2).
% 0.41/1.00 % set(auto2) -> set(auto).
% 0.41/1.00 % set(auto) -> set(auto_inference).
% 0.41/1.00 % set(auto) -> set(auto_setup).
% 0.41/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.00 % set(auto) -> set(auto_limits).
% 0.41/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.00 % set(auto) -> set(auto_denials).
% 0.41/1.00 % set(auto) -> set(auto_process).
% 0.41/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.00 % set(auto2) -> assign(stats, some).
% 0.41/1.00 % set(auto2) -> clear(echo_input).
% 0.41/1.00 % set(auto2) -> set(quiet).
% 0.41/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.00 % set(auto2) -> clear(print_given).
% 0.41/1.00 assign(lrs_ticks,-1).
% 0.41/1.00 assign(sos_limit,10000).
% 0.41/1.00 assign(order,kbo).
% 0.41/1.00 set(lex_order_vars).
% 0.41/1.00 clear(print_given).
% 0.41/1.00
% 0.41/1.00 % formulas(sos). % not echoed (19 formulas)
% 0.41/1.00
% 0.41/1.00 ============================== end of input ==========================
% 0.41/1.00
% 0.41/1.00 % From the command line: assign(max_seconds, 300).
% 0.41/1.00
% 0.41/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.00
% 0.41/1.00 % Formulas that are not ordinary clauses:
% 0.41/1.00 1 (exists Y24 all X19 (id(X19,Y24) & r1(X19) | -r1(X19) & -id(X19,Y24))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 2 (all X11 exists Y21 all X12 (id(X12,Y21) & r2(X11,X12) | -r2(X11,X12) & -id(X12,Y21))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 3 (all X13 all X14 exists Y22 all X15 (id(X15,Y22) & r3(X13,X14,X15) | -r3(X13,X14,X15) & -id(X15,Y22))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 4 (all X16 all X17 exists Y23 all X18 (id(X18,Y23) & r4(X16,X17,X18) | -r4(X16,X17,X18) & -id(X18,Y23))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 5 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 6 (all X21 all X22 (-id(X21,X22) | id(X22,X21))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 7 (all X23 all X24 all X25 (-id(X23,X24) | id(X23,X25) | -id(X24,X25))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 8 (all X26 all X27 (-id(X26,X27) | -r1(X26) & -r1(X27) | r1(X26) & r1(X27))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 9 (all X28 all X29 all X30 all X31 (-id(X28,X30) | -id(X29,X31) | -r2(X28,X29) & -r2(X30,X31) | r2(X28,X29) & r2(X30,X31))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 10 (all X32 all X33 all X34 all X35 all X36 all X37 (-id(X32,X35) | -id(X33,X36) | -id(X34,X37) | -r3(X32,X33,X34) & -r3(X35,X36,X37) | r3(X32,X33,X34) & r3(X35,X36,X37))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 11 (all X38 all X39 all X40 all X41 all X42 all X43 (-id(X38,X41) | -id(X39,X42) | -id(X40,X43) | -r4(X38,X39,X40) & -r4(X41,X42,X43) | r4(X38,X39,X40) & r4(X41,X42,X43))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.00 12 (all X1 all X8 exists Y4 ((exists Y5 (id(Y5,Y4) & (exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))))) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 13 (all X2 all X9 exists Y2 ((exists Y3 (id(Y3,Y2) & (exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))))) & (exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))))) # label(axiom_2a) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 14 (all X3 all X10 ((all Y12 ((all Y13 (-id(Y13,Y12) | -r2(X3,Y13))) | -r2(X10,Y12))) | id(X3,X10))) # label(axiom_3a) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 15 (all X4 exists Y9 (id(Y9,X4) & (exists Y16 (r1(Y16) & r3(X4,Y16,Y9))))) # label(axiom_4a) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 16 (all X5 exists Y8 ((exists Y17 (r1(Y17) & r4(X5,Y17,Y8))) & (exists Y18 (id(Y8,Y18) & r1(Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 17 (all X6 ((exists Y19 (id(X6,Y19) & r1(Y19))) | (exists Y1 exists Y11 (id(X6,Y11) & r2(Y1,Y11))))) # label(axiom_6a) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 18 (all X7 all Y10 ((all Y20 (-id(Y20,Y10) | -r1(Y20))) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 19 -(exists Y1 exists Y2 exists Y3 ((exists Y4 (id(Y4,Y1) & (exists Y6 (r4(Y6,Y2,Y4) & (exists Y7 (r2(Y7,Y6) & (exists Y8 (r1(Y8) & r2(Y8,Y7))))))))) & (exists Y5 (id(Y5,Y1) & r3(Y2,Y3,Y5))))) # label(thereexistsanevennumberid) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.29/1.58
% 1.29/1.58 ============================== end of process non-clausal formulas ===
% 1.29/1.58
% 1.29/1.58 ============================== PROCESS INITIAL CLAUSES ===============
% 1.29/1.58
% 1.29/1.58 ============================== PREDICATE ELIMINATION =================
% 1.29/1.58
% 1.29/1.58 ============================== end predicate elimination =============
% 1.29/1.58
% 1.29/1.58 Auto_denials: (non-Horn, no changes).
% 1.29/1.58
% 1.29/1.58 Term ordering decisions:
% 1.29/1.58 Function symbol KB weights: c1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f1=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1.
% 1.29/1.58
% 1.29/1.58 ============================== end of process initial clauses ========
% 1.29/1.58
% 1.29/1.58 ============================== CLAUSES FOR SEARCH ====================
% 1.29/1.58
% 1.29/1.58 ============================== end of clauses for search =============
% 1.29/1.58
% 1.29/1.58 ============================== SEARCH ================================
% 1.29/1.58
% 1.29/1.58 % Starting search at 0.01 seconds.
% 1.29/1.58
% 1.29/1.58 Low Water (keep): wt=16.000, iters=4015
% 1.29/1.58
% 1.29/1.58 Low Water (keep): wt=14.000, iters=3922
% 1.29/1.58
% 1.29/1.58 Low Water (keep): wt=13.000, iters=3647
% 1.29/1.58
% 1.29/1.58 Low Water (keep): wt=12.000, iters=5440
% 1.29/1.58
% 1.29/1.58 Low Water (keep): wt=11.000, iters=4262
% 1.29/1.58
% 1.29/1.58 ============================== PROOF =================================
% 1.29/1.58 % SZS status Theorem
% 1.29/1.58 % SZS output start Refutation
% 1.29/1.58
% 1.29/1.58 % Proof 1 at 0.58 (+ 0.02) seconds.
% 1.29/1.58 % Length of proof is 29.
% 1.29/1.58 % Level of proof is 5.
% 1.29/1.58 % Maximum clause weight is 22.000.
% 1.29/1.58 % Given clauses 115.
% 1.29/1.58
% 1.29/1.58 1 (exists Y24 all X19 (id(X19,Y24) & r1(X19) | -r1(X19) & -id(X19,Y24))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 2 (all X11 exists Y21 all X12 (id(X12,Y21) & r2(X11,X12) | -r2(X11,X12) & -id(X12,Y21))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 5 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 8 (all X26 all X27 (-id(X26,X27) | -r1(X26) & -r1(X27) | r1(X26) & r1(X27))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 12 (all X1 all X8 exists Y4 ((exists Y5 (id(Y5,Y4) & (exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))))) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 15 (all X4 exists Y9 (id(Y9,X4) & (exists Y16 (r1(Y16) & r3(X4,Y16,Y9))))) # label(axiom_4a) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 16 (all X5 exists Y8 ((exists Y17 (r1(Y17) & r4(X5,Y17,Y8))) & (exists Y18 (id(Y8,Y18) & r1(Y18))))) # label(axiom_5a) # label(axiom) # label(non_clause). [assumption].
% 1.29/1.58 19 -(exists Y1 exists Y2 exists Y3 ((exists Y4 (id(Y4,Y1) & (exists Y6 (r4(Y6,Y2,Y4) & (exists Y7 (r2(Y7,Y6) & (exists Y8 (r1(Y8) & r2(Y8,Y7))))))))) & (exists Y5 (id(Y5,Y1) & r3(Y2,Y3,Y5))))) # label(thereexistsanevennumberid) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.29/1.58 20 id(A,A) # label(axiom_5) # label(axiom). [clausify(5)].
% 1.29/1.58 22 r1(f15(A)) # label(axiom_5a) # label(axiom). [clausify(16)].
% 1.29/1.58 23 r1(f16(A)) # label(axiom_5a) # label(axiom). [clausify(16)].
% 1.29/1.58 24 id(f12(A),A) # label(axiom_4a) # label(axiom). [clausify(15)].
% 1.29/1.58 25 r2(A,f6(B,A)) # label(axiom_1a) # label(axiom). [clausify(12)].
% 1.29/1.58 27 id(f14(A),f16(A)) # label(axiom_5a) # label(axiom). [clausify(16)].
% 1.29/1.58 30 r3(A,f13(A),f12(A)) # label(axiom_4a) # label(axiom). [clausify(15)].
% 1.29/1.58 31 r4(A,f15(A),f14(A)) # label(axiom_5a) # label(axiom). [clausify(16)].
% 1.29/1.58 43 -id(A,B) | -r4(C,D,A) | -r2(E,C) | -r1(F) | -r2(F,E) | -id(V6,B) | -r3(D,V7,V6) # label(thereexistsanevennumberid) # label(negated_conjecture). [clausify(19)].
% 1.29/1.58 44 id(A,c1) | -r1(A) # label(axiom_1) # label(axiom). [clausify(1)].
% 1.29/1.58 48 r2(A,B) | -id(B,f1(A)) # label(axiom_2) # label(axiom). [clausify(2)].
% 1.29/1.58 50 -id(A,B) | -r1(B) | r1(A) # label(axiom_8) # label(axiom). [clausify(8)].
% 1.29/1.58 821 r2(A,f1(A)). [resolve(48,b,20,a)].
% 1.29/1.58 829 r1(f14(A)). [resolve(50,a,27,a),unit_del(a,23)].
% 1.29/1.58 830 -r1(A) | r1(f12(A)). [resolve(50,a,24,a)].
% 1.29/1.58 1378 id(f14(A),c1). [resolve(829,a,44,b)].
% 1.29/1.58 7792 r1(f12(f16(A))). [resolve(830,a,23,a)].
% 1.29/1.58 7793 r1(f12(f15(A))). [resolve(830,a,22,a)].
% 1.29/1.58 8215 -id(f12(f15(f6(A,f1(f12(f16(B)))))),c1). [ur(43,a,1378,a,b,31,a,c,25,a,d,7792,a,e,821,a,g,30,a)].
% 1.29/1.58 8353 id(f12(f15(A)),c1). [resolve(7793,a,44,b)].
% 1.29/1.58 8354 $F. [resolve(8353,a,8215,a)].
% 1.29/1.58
% 1.29/1.58 % SZS output end Refutation
% 1.29/1.58 ============================== end of proof ==========================
% 1.29/1.58
% 1.29/1.58 ============================== STATISTICS ============================
% 1.29/1.58
% 1.29/1.58 Given=115. Generated=25161. Kept=8334. proofs=1.
% 1.29/1.58 Usable=115. Sos=7905. Demods=0. Limbo=1, Disabled=355. Hints=0.
% 1.29/1.58 Megabytes=6.03.
% 1.29/1.58 User_CPU=0.58, System_CPU=0.02, Wall_clock=1.
% 1.29/1.58
% 1.29/1.58 ============================== end of statistics =====================
% 1.29/1.58
% 1.29/1.58 ============================== end of search =========================
% 1.29/1.58
% 1.29/1.58 THEOREM PROVED
% 1.29/1.58 % SZS status Theorem
% 1.29/1.58
% 1.29/1.58 Exiting with 1 proof.
% 1.29/1.58
% 1.29/1.58 Process 21449 exit (max_proofs) Thu Jun 2 08:55:09 2022
% 1.29/1.58 Prover9 interrupted
%------------------------------------------------------------------------------