TSTP Solution File: NUN074+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : NUN074+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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 : Timeout 300.07s 300.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUN074+2 : TPTP v8.1.0. Released v7.3.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 2 06:41:19 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.47/1.03 ============================== Prover9 ===============================
% 0.47/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.03 Process 29224 was started by sandbox2 on n027.cluster.edu,
% 0.47/1.03 Thu Jun 2 06:41:20 2022
% 0.47/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_29071_n027.cluster.edu".
% 0.47/1.03 ============================== end of head ===========================
% 0.47/1.03
% 0.47/1.03 ============================== INPUT =================================
% 0.47/1.03
% 0.47/1.03 % Reading from file /tmp/Prover9_29071_n027.cluster.edu
% 0.47/1.03
% 0.47/1.03 set(prolog_style_variables).
% 0.47/1.03 set(auto2).
% 0.47/1.03 % set(auto2) -> set(auto).
% 0.47/1.03 % set(auto) -> set(auto_inference).
% 0.47/1.03 % set(auto) -> set(auto_setup).
% 0.47/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.03 % set(auto) -> set(auto_limits).
% 0.47/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.03 % set(auto) -> set(auto_denials).
% 0.47/1.03 % set(auto) -> set(auto_process).
% 0.47/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.03 % set(auto2) -> assign(stats, some).
% 0.47/1.03 % set(auto2) -> clear(echo_input).
% 0.47/1.03 % set(auto2) -> set(quiet).
% 0.47/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.03 % set(auto2) -> clear(print_given).
% 0.47/1.03 assign(lrs_ticks,-1).
% 0.47/1.03 assign(sos_limit,10000).
% 0.47/1.03 assign(order,kbo).
% 0.47/1.03 set(lex_order_vars).
% 0.47/1.03 clear(print_given).
% 0.47/1.03
% 0.47/1.03 % formulas(sos). % not echoed (12 formulas)
% 0.47/1.03
% 0.47/1.03 ============================== end of input ==========================
% 0.47/1.03
% 0.47/1.03 % From the command line: assign(max_seconds, 300).
% 0.47/1.03
% 0.47/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.03
% 0.47/1.03 % Formulas that are not ordinary clauses:
% 0.47/1.03 1 (exists Y24 all X19 (-r1(X19) & X19 != Y24 | r1(X19) & X19 = Y24)) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 2 (all X11 exists Y21 all X12 (-r2(X11,X12) & X12 != Y21 | r2(X11,X12) & X12 = Y21)) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 3 (all X13 all X14 exists Y22 all X15 (-r3(X13,X14,X15) & X15 != Y22 | r3(X13,X14,X15) & X15 = Y22)) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 4 (all X16 all X17 exists Y23 all X18 (-r4(X16,X17,X18) & X18 != Y23 | r4(X16,X17,X18) & X18 = Y23)) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 5 (all X1 all X8 exists Y4 ((exists Y5 ((exists Y15 (r2(X8,Y15) & r3(X1,Y15,Y5))) & Y5 = Y4)) & (exists Y7 (r2(Y7,Y4) & r3(X1,X8,Y7))))) # label(axiom_1a) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 6 (all X2 all X9 exists Y2 ((exists Y3 ((exists Y14 (r2(X9,Y14) & r4(X2,Y14,Y3))) & Y3 = Y2)) & (exists Y6 (r3(Y6,X2,Y2) & r4(X2,X9,Y6))))) # label(axiom_2a) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 7 (all X3 all X10 ((all Y12 ((all Y13 (-r2(X3,Y13) | Y13 != Y12)) | -r2(X10,Y12))) | X3 = X10)) # label(axiom_3a) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 8 (all X4 exists Y9 ((exists Y16 (r1(Y16) & r3(X4,Y16,Y9))) & Y9 = X4)) # label(axiom_4a) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 9 (all X5 exists Y8 ((exists Y17 (r1(Y17) & r4(X5,Y17,Y8))) & (exists Y18 (r1(Y18) & Y8 = Y18)))) # label(axiom_5a) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 10 (all X6 ((exists Y19 (r1(Y19) & X6 = Y19)) | (exists Y1 exists Y11 (r2(Y1,Y11) & X6 = Y11)))) # label(axiom_6a) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 11 (all X7 all Y10 ((all Y20 (-r1(Y20) | Y20 != Y10)) | -r2(X7,Y10))) # label(axiom_7a) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.03 12 -(exists Y1 ((all X1 all X2 ((all Y2 all Y6 (-r3(X1,Y2,Y6) | Y6 != Y1)) | (all Y3 all Y5 (-r3(X2,Y3,Y5) | Y5 != Y1)) | (all Y4 (-r4(X1,X2,Y4) | Y4 != Y1)) | (exists Y7 (X1 = Y7 & (exists Y9 (r1(Y9) & r2(Y9,Y7))))) | (exists Y8 (X2 = Y8 & (exists Y10 (r1(Y10) & r2(Y10,Y8))))))) & (all Y11 (-r1(Y11) | Y1 != Y11)))) # label(primeexist) # label(negated_conjecture) # label(non_clause). [assumption].
% 4.68/4.96
% 4.68/4.96 ============================== end of process non-clausal formulas ===
% 4.68/4.96
% 4.68/4.96 ============================== PROCESS INITIAL CLAUSES ===============
% 4.68/4.96
% 4.68/4.96 ============================== PREDICATE ELIMINATION =================
% 4.68/4.96 13 -r3(A,B,C) | C = f2(A,B) # label(axiom_3) # label(axiom). [clausify(3)].
% 4.68/4.96 14 r3(A,B,f7(A,B)) # label(axiom_1a) # label(axiom). [clausify(5)].
% 4.68/4.96 15 r3(A,f13(A),f12(A)) # label(axiom_4a) # label(axiom). [clausify(8)].
% 4.68/4.96 16 r3(A,f6(A,B),f5(A,B)) # label(axiom_1a) # label(axiom). [clausify(5)].
% 4.68/4.96 17 r3(f11(A,B),A,f8(A,B)) # label(axiom_2a) # label(axiom). [clausify(6)].
% 4.68/4.96 18 r3(f20(A),f22(A),f23(A)) | r1(f27(A)) # label(primeexist) # label(negated_conjecture). [clausify(12)].
% 4.68/4.96 19 r3(f21(A),f24(A),f25(A)) | r1(f27(A)) # label(primeexist) # label(negated_conjecture). [clausify(12)].
% 4.68/4.96 20 r3(f20(A),f22(A),f23(A)) | f27(A) = A # label(primeexist) # label(negated_conjecture). [clausify(12)].
% 4.68/4.96 21 r3(f21(A),f24(A),f25(A)) | f27(A) = A # label(primeexist) # label(negated_conjecture). [clausify(12)].
% 4.68/4.96 Derived: f7(A,B) = f2(A,B). [resolve(13,a,14,a)].
% 4.68/4.96 Derived: f12(A) = f2(A,f13(A)). [resolve(13,a,15,a)].
% 4.68/4.96 Derived: f5(A,B) = f2(A,f6(A,B)). [resolve(13,a,16,a)].
% 4.68/4.96 Derived: f8(A,B) = f2(f11(A,B),A). [resolve(13,a,17,a)].
% 4.68/4.96 Derived: f23(A) = f2(f20(A),f22(A)) | r1(f27(A)). [resolve(13,a,18,a)].
% 4.68/4.96 Derived: f25(A) = f2(f21(A),f24(A)) | r1(f27(A)). [resolve(13,a,19,a)].
% 4.68/4.96 Derived: f23(A) = f2(f20(A),f22(A)) | f27(A) = A. [resolve(13,a,20,a)].
% 4.68/4.96 Derived: f25(A) = f2(f21(A),f24(A)) | f27(A) = A. [resolve(13,a,21,a)].
% 4.68/4.96 22 A != f2(B,C) | r3(B,C,A) # label(axiom_3) # label(axiom). [clausify(3)].
% 4.68/4.96 23 -r4(A,B,C) | C = f3(A,B) # label(axiom_4) # label(axiom). [clausify(4)].
% 4.68/4.96 24 r4(A,B,f11(A,B)) # label(axiom_2a) # label(axiom). [clausify(6)].
% 4.68/4.96 25 r4(A,f15(A),f14(A)) # label(axiom_5a) # label(axiom). [clausify(9)].
% 4.68/4.96 26 r4(A,f10(A,B),f9(A,B)) # label(axiom_2a) # label(axiom). [clausify(6)].
% 4.68/4.96 27 r4(f20(A),f21(A),f26(A)) | r1(f27(A)) # label(primeexist) # label(negated_conjecture). [clausify(12)].
% 4.68/4.96 28 r4(f20(A),f21(A),f26(A)) | f27(A) = A # label(primeexist) # label(negated_conjecture). [clausify(12)].
% 4.68/4.96 Derived: f11(A,B) = f3(A,B). [resolve(23,a,24,a)].
% 4.68/4.96 Derived: f14(A) = f3(A,f15(A)). [resolve(23,a,25,a)].
% 4.68/4.96 Derived: f9(A,B) = f3(A,f10(A,B)). [resolve(23,a,26,a)].
% 4.68/4.96 Derived: f26(A) = f3(f20(A),f21(A)) | r1(f27(A)). [resolve(23,a,27,a)].
% 4.68/4.96 Derived: f26(A) = f3(f20(A),f21(A)) | f27(A) = A. [resolve(23,a,28,a)].
% 4.68/4.96 29 A != f3(B,C) | r4(B,C,A) # label(axiom_4) # label(axiom). [clausify(4)].
% 4.68/4.96
% 4.68/4.96 ============================== end predicate elimination =============
% 4.68/4.96
% 4.68/4.96 Auto_denials: (non-Horn, no changes).
% 4.68/4.96
% 4.68/4.96 Term ordering decisions:
% 4.68/4.96 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. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1.
% 4.68/4.96
% 4.68/4.96 ============================== end of process initial clauses ========
% 4.68/4.96
% 4.68/4.96 ============================== CLAUSES FOR SEARCH ====================
% 4.68/4.96
% 4.68/4.96 ============================== end of clauses for search =============
% 4.68/4.96
% 4.68/4.96 ============================== SEARCH ================================
% 4.68/4.96
% 4.68/4.96 % Starting search at 0.02 seconds.
% 4.68/4.96
% 4.68/4.96 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 27 (0.00 of 0.48 sec).
% 4.68/4.96
% 4.68/4.96 Low Water (keep): wt=22.000, iters=3679
% 4.68/4.96
% 4.68/4.96 Low Water (keep): wt=21.000, iters=3591
% 4.68/4.96
% 4.68/4.96 Low Water (keep): wt=20.000, iters=3441
% 4.68/4.96
% 4.68/4.96 Low Water (keep): wt=19.000, iters=3346
% 4.68/4.96
% 4.68/4.96 Low Water (keep): wt=18.000, iters=3357
% 4.68/4.96
% 4.68/4.96 Low Water (keep): wt=17.000, iters=3416
% 4.68/4.96
% 4.68/4.96 Low Water (keep): wt=16.000, iters=3384
% 4.68/4.96
% 4.68/4.96 Low Water (keep): wt=15.000, iters=3336
% 4.68/4.96
% 4.68/4.96 Low Water (displace): id=4131, wt=24.000
% 4.68/4.96
% 4.68/4.96 Low Water (displace): id=2967, wt=23.000
% 4.68/4.96
% 4.68/4.96 Low Water (displace): id=4179, wt=22.000
% 4.68/4.96
% 4.68/4.96 Low Water (displace): id=4165, wt=21.000
% 4.68/4.96
% 4.68/4.96 Low Water (keep): wt=14.000, iters=3339
% 4.68/4.96
% 4.68/4.96 Low Water (displace): id=Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------