TSTP Solution File: NUN060+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUN060+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:06 EDT 2022
% Result : Theorem 0.80s 1.10s
% Output : Refutation 0.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUN060+1 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 2 09:13:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.80/1.10 ============================== Prover9 ===============================
% 0.80/1.10 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.10 Process 8158 was started by sandbox on n020.cluster.edu,
% 0.80/1.10 Thu Jun 2 09:13:24 2022
% 0.80/1.10 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8005_n020.cluster.edu".
% 0.80/1.10 ============================== end of head ===========================
% 0.80/1.10
% 0.80/1.10 ============================== INPUT =================================
% 0.80/1.10
% 0.80/1.10 % Reading from file /tmp/Prover9_8005_n020.cluster.edu
% 0.80/1.10
% 0.80/1.10 set(prolog_style_variables).
% 0.80/1.10 set(auto2).
% 0.80/1.10 % set(auto2) -> set(auto).
% 0.80/1.10 % set(auto) -> set(auto_inference).
% 0.80/1.10 % set(auto) -> set(auto_setup).
% 0.80/1.10 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.10 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.10 % set(auto) -> set(auto_limits).
% 0.80/1.10 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.10 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.10 % set(auto) -> set(auto_denials).
% 0.80/1.10 % set(auto) -> set(auto_process).
% 0.80/1.10 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.10 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.10 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.10 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.10 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.10 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.10 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.10 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.10 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.10 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.10 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.10 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.10 % set(auto2) -> assign(stats, some).
% 0.80/1.10 % set(auto2) -> clear(echo_input).
% 0.80/1.10 % set(auto2) -> set(quiet).
% 0.80/1.10 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.10 % set(auto2) -> clear(print_given).
% 0.80/1.10 assign(lrs_ticks,-1).
% 0.80/1.10 assign(sos_limit,10000).
% 0.80/1.10 assign(order,kbo).
% 0.80/1.10 set(lex_order_vars).
% 0.80/1.10 clear(print_given).
% 0.80/1.10
% 0.80/1.10 % formulas(sos). % not echoed (19 formulas)
% 0.80/1.10
% 0.80/1.10 ============================== end of input ==========================
% 0.80/1.10
% 0.80/1.10 % From the command line: assign(max_seconds, 300).
% 0.80/1.10
% 0.80/1.10 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.10
% 0.80/1.10 % Formulas that are not ordinary clauses:
% 0.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 5 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 6 (all X21 all X22 (-id(X21,X22) | id(X22,X21))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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.80/1.10 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].
% 0.80/1.10 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].
% 0.80/1.10 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].
% 0.80/1.10 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].
% 0.80/1.10 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].
% 0.80/1.10 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].
% 0.80/1.10 18 (all X7 all Y10 ((all Y20 (-id(Y20,Y10) | -r1(Y20))) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 19 -(exists Y1 exists Y2 exists Y3 (id(Y3,Y1) & (exists Y4 (r3(Y2,Y4,Y3) & (exists Y5 (r2(Y5,Y4) & (exists Y6 (r2(Y6,Y5) & (exists Y7 (r2(Y7,Y6) & (exists Y8 (r1(Y8) & r2(Y8,Y7))))))))))))) # label(greq4id) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.80/1.10
% 0.80/1.10 ============================== end of process non-clausal formulas ===
% 0.80/1.10
% 0.80/1.10 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.10
% 0.80/1.10 ============================== PREDICATE ELIMINATION =================
% 0.80/1.10
% 0.80/1.10 ============================== end predicate elimination =============
% 0.80/1.10
% 0.80/1.10 Auto_denials: (non-Horn, no changes).
% 0.80/1.10
% 0.80/1.10 Term ordering decisions:
% 0.80/1.10 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.
% 0.80/1.10
% 0.80/1.10 ============================== end of process initial clauses ========
% 0.80/1.10
% 0.80/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.80/1.10
% 0.80/1.10 ============================== end of clauses for search =============
% 0.80/1.10
% 0.80/1.10 ============================== SEARCH ================================
% 0.80/1.10
% 0.80/1.10 % Starting search at 0.02 seconds.
% 0.80/1.10
% 0.80/1.10 ============================== PROOF =================================
% 0.80/1.10 % SZS status Theorem
% 0.80/1.10 % SZS output start Refutation
% 0.80/1.10
% 0.80/1.10 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.80/1.10 % Length of proof is 11.
% 0.80/1.10 % Level of proof is 3.
% 0.80/1.10 % Maximum clause weight is 21.000.
% 0.80/1.10 % Given clauses 24.
% 0.80/1.10
% 0.80/1.10 5 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.80/1.10 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].
% 0.80/1.10 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].
% 0.80/1.10 19 -(exists Y1 exists Y2 exists Y3 (id(Y3,Y1) & (exists Y4 (r3(Y2,Y4,Y3) & (exists Y5 (r2(Y5,Y4) & (exists Y6 (r2(Y6,Y5) & (exists Y7 (r2(Y7,Y6) & (exists Y8 (r1(Y8) & r2(Y8,Y7))))))))))))) # label(greq4id) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.80/1.10 20 id(A,A) # label(axiom_5) # label(axiom). [clausify(5)].
% 0.80/1.10 23 r1(f16(A)) # label(axiom_5a) # label(axiom). [clausify(16)].
% 0.80/1.10 26 r2(A,f10(B,A)) # label(axiom_2a) # label(axiom). [clausify(13)].
% 0.80/1.10 38 r3(f11(A,B),A,f8(A,B)) # label(axiom_2a) # label(axiom). [clausify(13)].
% 0.80/1.10 43 -id(A,B) | -r3(C,D,A) | -r2(E,D) | -r2(F,E) | -r2(V6,F) | -r1(V7) | -r2(V7,V6) # label(greq4id) # label(negated_conjecture). [clausify(19)].
% 0.80/1.10 118 -id(f8(f10(A,f10(B,f10(C,f10(D,f16(E))))),F),V6). [ur(43,b,38,a,c,26,a,d,26,a,e,26,a,f,23,a,g,26,a)].
% 0.80/1.10 119 $F. [resolve(118,a,20,a)].
% 0.80/1.10
% 0.80/1.10 % SZS output end Refutation
% 0.80/1.10 ============================== end of proof ==========================
% 0.80/1.10
% 0.80/1.10 ============================== STATISTICS ============================
% 0.80/1.10
% 0.80/1.10 Given=24. Generated=127. Kept=99. proofs=1.
% 0.80/1.10 Usable=24. Sos=71. Demods=0. Limbo=3, Disabled=43. Hints=0.
% 0.80/1.10 Megabytes=0.17.
% 0.80/1.10 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.80/1.10
% 0.80/1.10 ============================== end of statistics =====================
% 0.80/1.11
% 0.80/1.11 ============================== end of search =========================
% 0.80/1.11
% 0.80/1.11 THEOREM PROVED
% 0.80/1.11 % SZS status Theorem
% 0.80/1.11
% 0.80/1.11 Exiting with 1 proof.
% 0.80/1.11
% 0.80/1.11 Process 8158 exit (max_proofs) Thu Jun 2 09:13:24 2022
% 0.80/1.11 Prover9 interrupted
%------------------------------------------------------------------------------