TSTP Solution File: NUN063+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUN063+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 : Timeout 300.05s 300.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : NUN063+1 : TPTP v8.1.0. Released v7.3.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n029.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 : Thu Jun 2 10:41:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.04 ============================== Prover9 ===============================
% 0.43/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.04 Process 29082 was started by sandbox2 on n029.cluster.edu,
% 0.43/1.04 Thu Jun 2 10:41:32 2022
% 0.43/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28925_n029.cluster.edu".
% 0.43/1.04 ============================== end of head ===========================
% 0.43/1.04
% 0.43/1.04 ============================== INPUT =================================
% 0.43/1.04
% 0.43/1.04 % Reading from file /tmp/Prover9_28925_n029.cluster.edu
% 0.43/1.04
% 0.43/1.04 set(prolog_style_variables).
% 0.43/1.04 set(auto2).
% 0.43/1.04 % set(auto2) -> set(auto).
% 0.43/1.04 % set(auto) -> set(auto_inference).
% 0.43/1.04 % set(auto) -> set(auto_setup).
% 0.43/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.04 % set(auto) -> set(auto_limits).
% 0.43/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.04 % set(auto) -> set(auto_denials).
% 0.43/1.04 % set(auto) -> set(auto_process).
% 0.43/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.04 % set(auto2) -> assign(stats, some).
% 0.43/1.04 % set(auto2) -> clear(echo_input).
% 0.43/1.04 % set(auto2) -> set(quiet).
% 0.43/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.04 % set(auto2) -> clear(print_given).
% 0.43/1.04 assign(lrs_ticks,-1).
% 0.43/1.04 assign(sos_limit,10000).
% 0.43/1.04 assign(order,kbo).
% 0.43/1.04 set(lex_order_vars).
% 0.43/1.04 clear(print_given).
% 0.43/1.04
% 0.43/1.04 % formulas(sos). % not echoed (19 formulas)
% 0.43/1.04
% 0.43/1.04 ============================== end of input ==========================
% 0.43/1.04
% 0.43/1.04 % From the command line: assign(max_seconds, 300).
% 0.43/1.04
% 0.43/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.04
% 0.43/1.04 % Formulas that are not ordinary clauses:
% 0.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 5 (all X20 id(X20,X20)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 6 (all X21 all X22 (-id(X21,X22) | id(X22,X21))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.43/1.04 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.86/2.17 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.86/2.17 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.86/2.17 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.86/2.17 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.86/2.17 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.86/2.17 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.86/2.17 19 -((exists Y4 ((all X1 all X3 ((all Y17 (-id(Y17,Y4) | -r4(X1,X3,Y17))) | (all Y5 all Y19 (-id(Y19,Y4) | -r3(X1,Y5,Y19))) | (all Y6 all Y18 (-id(Y18,Y4) | -r3(X3,Y6,Y18))) | (exists Y20 (id(X1,Y20) & (exists Y26 (r1(Y26) & r2(Y26,Y20))))) | (exists Y21 (id(X3,Y21) & (exists Y27 (r1(Y27) & r2(Y27,Y21))))))) & (all Y28 (-id(Y4,Y28) | -r1(Y28))))) & (all X2 ((exists X4 exists X6 ((all Y22 ((all Y29 (-r1(Y29) | -r2(Y29,Y22))) | -id(X4,Y22))) & (all Y23 ((all Y30 (-r1(Y30) | -r2(Y30,Y23))) | -id(X6,Y23))) & (exists Y14 (id(Y14,X2) & r4(X4,X6,Y14))) & (exists Y1 exists Y16 (id(Y16,X2) & r3(X4,Y1,Y16))) & (exists Y2 exists Y15 (id(Y15,X2) & r3(X6,Y2,Y15))))) | (exists Y31 (id(X2,Y31) & r1(Y31))) | (exists Y3 ((all X5 all X7 ((all Y10 (-id(Y10,Y3) | -r4(X5,X7,Y10))) | (all Y7 all Y12 (-id(Y12,Y3) | -r3(X5,Y7,Y12))) | (all Y8 all Y11 (-id(Y11,Y3) | -r3(X7,Y8,Y11))) | (exists Y24 (id(X5,Y24) & (exists Y33 (r1(Y33) & r2(Y33,Y24))))) | (exists Y25 (id(X7,Y25) & (exists Y34 (r1(Y34) & r2(Y34,Y25))))))) & (all Y35 (-id(Y3,Y35) | -r1(Y35))) & (exists Y9 ((all Y32 (-id(Y9,Y32) | -r1(Y32))) & (exists Y13 (id(Y13,Y3) & r3(X2,Y9,Y13)))))))))) # label(infprimesid) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.86/2.17
% 1.86/2.17 ============================== end of process non-clausal formulas ===
% 1.86/2.17
% 1.86/2.17 ============================== PROCESS INITIAL CLAUSES ===============
% 1.86/2.17
% 1.86/2.17 ============================== PREDICATE ELIMINATION =================
% 1.86/2.17
% 1.86/2.17 ============================== end predicate elimination =============
% 1.86/2.17
% 1.86/2.17 Auto_denials: (non-Horn, no changes).
% 1.86/2.17
% 1.86/2.17 Term ordering decisions:
% 1.86/2.17 Function symbol KB weights: c1=1. c2=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f28=1. f29=1. f30=1. f31=1. f40=1. f1=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1. f32=1. f33=1. f34=1. f35=1. f36=1. f37=1. f38=1. f39=1.
% 1.86/2.17
% 1.86/2.17 ============================== end of process initial clauses ========
% 1.86/2.17
% 1.86/2.17 ============================== CLAUSES FOR SEARCH ====================
% 1.86/2.17
% 1.86/2.17 ============================== end of clauses for search =============
% 1.86/2.17
% 1.86/2.17 ============================== SEARCH ================================
% 1.86/2.17
% 1.86/2.17 % Starting search at 0.35 seconds.
% 1.86/2.17
% 1.86/2.17 Low Water (keep): wt=45.000, iters=3419
% 1.86/2.17
% 1.86/2.17 Low Water (keep): wt=44.000, iters=3471
% 1.86/2.17
% 1.86/2.17 Low Water (keep): wt=43.000, iters=3416
% 1.86/2.17
% 1.86/2.17 Low Water (keep): wt=42.000, iters=3339
% 1.86/2.17
% 1.86/2.17 Low Water (keep): wt=41.000, iters=3454
% 1.86/2.17
% 1.86/2.17 Low Water (keep): wt=40.000, iters=3468
% 1.86/2.17
% 1.86/2.17 Low Water (keep): wt=39.000, iters=3448
% 1.86/2.17
% 1.86/2.17 Low Water (keep): wt=38.000, iters=3435
% 1.86/2.17
% 1.86/2.17 Low Water (keep): wt=37.000, iters=3385
% 1.86/2.17
% 1.86/2.17 Low Water (keep): wt=36.000, iters=3347
% 1.86/2.17
% 1.86/2.17 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 2147483647 (0.00 of 0.51 sec).
% 1.86/2.17
% 1.86/2.17 Low Water (keep): wt=35.000, iters=3339
% 1.86/2.17
% 1.86/2.17 Low Water (keep): wt=34.000, iters=3333
% 1.86/2.17
% 1.86/2.17 Low Water (displace): id=5581, wt=54.000
% 1.86/2.17
% 1.86/2.17 Low Water (displace): id=12754, wt=18.000
% 1.86/2.17
% 1.86/2.17 Low Water (displace): id=12787, wt=15.000
% 1.86/2.17
% 1.86/2.17 Low Water (displace): id=12792, wt=11.000
% 1.86/2.17
% 1.86/2.17 Low Water (displace): id=12794, wt=9.000
% 1.86/2.17
% 1.86/2.17 Low Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------