0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.13/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.34 % Computer : n024.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 960 0.14/0.34 % WCLimit : 120 0.14/0.34 % DateTime : Tue Aug 9 03:31:22 EDT 2022 0.14/0.34 % CPUTime : 5.14/5.46 ============================== Prover9 =============================== 5.14/5.46 Prover9 (32) version 2009-11A, November 2009. 5.14/5.46 Process 8031 was started by sandbox on n024.cluster.edu, 5.14/5.46 Tue Aug 9 03:31:23 2022 5.14/5.46 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_7795_n024.cluster.edu". 5.14/5.46 ============================== end of head =========================== 5.14/5.46 5.14/5.46 ============================== INPUT ================================= 5.14/5.46 5.14/5.46 % Reading from file /tmp/Prover9_7795_n024.cluster.edu 5.14/5.46 5.14/5.46 set(prolog_style_variables). 5.14/5.46 set(auto2). 5.14/5.46 % set(auto2) -> set(auto). 5.14/5.46 % set(auto) -> set(auto_inference). 5.14/5.46 % set(auto) -> set(auto_setup). 5.14/5.46 % set(auto_setup) -> set(predicate_elim). 5.14/5.46 % set(auto_setup) -> assign(eq_defs, unfold). 5.14/5.46 % set(auto) -> set(auto_limits). 5.14/5.46 % set(auto_limits) -> assign(max_weight, "100.000"). 5.14/5.46 % set(auto_limits) -> assign(sos_limit, 20000). 5.14/5.46 % set(auto) -> set(auto_denials). 5.14/5.46 % set(auto) -> set(auto_process). 5.14/5.46 % set(auto2) -> assign(new_constants, 1). 5.14/5.46 % set(auto2) -> assign(fold_denial_max, 3). 5.14/5.46 % set(auto2) -> assign(max_weight, "200.000"). 5.14/5.46 % set(auto2) -> assign(max_hours, 1). 5.14/5.46 % assign(max_hours, 1) -> assign(max_seconds, 3600). 5.14/5.46 % set(auto2) -> assign(max_seconds, 0). 5.14/5.46 % set(auto2) -> assign(max_minutes, 5). 5.14/5.46 % assign(max_minutes, 5) -> assign(max_seconds, 300). 5.14/5.46 % set(auto2) -> set(sort_initial_sos). 5.14/5.46 % set(auto2) -> assign(sos_limit, -1). 5.14/5.46 % set(auto2) -> assign(lrs_ticks, 3000). 5.14/5.46 % set(auto2) -> assign(max_megs, 400). 5.14/5.46 % set(auto2) -> assign(stats, some). 5.14/5.46 % set(auto2) -> clear(echo_input). 5.14/5.46 % set(auto2) -> set(quiet). 5.14/5.46 % set(auto2) -> clear(print_initial_clauses). 5.14/5.46 % set(auto2) -> clear(print_given). 5.14/5.46 assign(lrs_ticks,-1). 5.14/5.46 assign(sos_limit,10000). 5.14/5.46 assign(order,kbo). 5.14/5.46 set(lex_order_vars). 5.14/5.46 clear(print_given). 5.14/5.46 5.14/5.46 % formulas(sos). % not echoed (2 formulas) 5.14/5.46 5.14/5.46 ============================== end of input ========================== 5.14/5.46 5.14/5.46 % From the command line: assign(max_seconds, 960). 5.14/5.46 5.14/5.46 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 5.14/5.46 5.14/5.46 % Formulas that are not ordinary clauses: 5.14/5.46 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption]. 5.14/5.46 2 --(exists X -(-(all Y (-r1(X,Y) | p4(Y) | -(all X (-p4(X) | (all Y (-r1(X,Y) | p4(Y))) | -r1(Y,X))))) | -(all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -p1(X) | (all Y (-r1(X,Y) | p1(Y))))) | p1(Y))) | -(((-(all Y ((all X (-r1(Y,X) | p2(X))) | -p2(Y) | -r1(X,Y))) | p2(X)) & (-(all Y (-r1(X,Y) | -(all X (-p2(X) | (all Y (p2(Y) | -r1(X,Y))) | -r1(Y,X))) | p2(Y))) | (all Y (-r1(X,Y) | (all X (-(all Y (-p2(Y) | (all X (p2(X) | -r1(Y,X))) | -r1(X,Y))) | p2(X) | -r1(Y,X)))))) | -(all Y ((-(all X (-p2(X) | (all Y (-r1(X,Y) | p2(Y))) | -r1(Y,X))) | p2(Y)) & ((all X ((all Y (-r1(X,Y) | -(all X (-r1(Y,X) | (all Y (-r1(X,Y) | p2(Y))) | -p2(X))) | p2(Y))) | -r1(Y,X))) | -(all X (-(all Y (-p2(Y) | (all X (p2(X) | -r1(Y,X))) | -r1(X,Y))) | p2(X) | -r1(Y,X)))) | -(all X (-r1(Y,X) | -(((all Y ((all X (-r1(Y,X) | p2(X) | -(all Y (-r1(X,Y) | (all X (p2(X) | -r1(Y,X))) | -p2(Y))))) | -r1(X,Y))) | -(all Y (-(all X ((all Y (p2(Y) | -r1(X,Y))) | -p2(X) | -r1(Y,X))) | p2(Y) | -r1(X,Y)))) & (-(all Y (-p2(Y) | (all X (-r1(Y,X) | p2(X))) | -r1(X,Y))) | p2(X))) | (all Y ((-(all X (-p2(X) | (all Y (p2(Y) | -r1(X,Y))) | -r1(Y,X))) | p2(Y)) & (-(all X (-r1(Y,X) | p2(X) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p2(X))) | -p2(Y))))) | (all X ((all Y (-r1(X,Y) | -(all X ((all Y (-r1(X,Y) | p2(Y))) | -p2(X) | -r1(Y,X))) | p2(Y))) | -r1(Y,X)))) | -r1(X,Y))))) | -r1(X,Y)))) & (all Y (-r1(X,Y) | -(all X (-(all Y (-p2(Y) | (all X (-r1(Y,X) | p2(X))) | -r1(X,Y))) | p2(X) | -r1(Y,X))) | p2(Y)))) | (all Y (-r1(X,Y) | p1(Y))) | (-(all Y (p2(Y) | -(all X (-p2(X) | (all Y (p2(Y) | -r1(X,Y))) | -r1(Y,X))) | -r1(X,Y))) | (all Y (p2(Y) | -r1(X,Y)))) & -(all Y (-r1(X,Y) | -(all X (-p3(X) | -r1(Y,X))))) | (all Y (-r1(X,Y) | p4(Y))) | ((all Y (-r1(X,Y) | p2(Y))) | -(all Y (-r1(X,Y) | -(all X ((all Y (p2(Y) | -r1(X,Y))) | -p2(X) | -r1(Y,X))) | p2(Y)))) & -(all Y (-r1(X,Y) | -p3(Y))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption]. 13.09/13.39 13.09/13.39 ============================== end of process non-clausal formulas === 13.09/13.39 13.09/13.39 ============================== PROCESS INITIAL CLAUSES =============== 13.09/13.39 13.09/13.39 ============================== PREDICATE ELIMINATION ================= 13.09/13.39 3 r1(c1,c11) | -r1(c1,A) | -p3(A) # label(main) # label(negated_conjecture). [clausify(2)]. 13.09/13.39 4 p2(A) | p2(f19(A)) | -r1(c1,A) | -r1(c1,B) | p3(f21(B)) # label(main) # label(negated_conjecture). [clausify(2)]. 13.09/13.39 5 p2(A) | -p2(f20(A)) | -r1(c1,A) | -r1(c1,B) | p3(f21(B)) # label(main) # label(negated_conjecture). [clausify(2)]. 13.09/13.39 6 p2(A) | r1(f19(A),f20(A)) | -r1(c1,A) | -r1(c1,B) | p3(f21(B)) # label(main) # label(negated_conjecture). [clausify(2)]. 13.09/13.39 7 p2(A) | r1(A,f19(A)) | -r1(c1,A) | -r1(c1,B) | p3(f21(B)) # label(main) # label(negated_conjecture). [clausify(2)]. 13.09/13.39 8 -p2(c9) | -r1(c1,A) | p3(f21(A)) # label(main) # label(negated_conjecture). [clausify(2)]. 13.09/13.39 9 r1(c1,c9) | -r1(c1,A) | p3(f21(A)) # label(main) # label(negated_conjecture). [clausify(2)]. 13.09/13.39 Derived: r1(c1,c11) | -r1(c1,f21(A)) | p2(B) | p2(f19(B)) | -r1(c1,B) | -r1(c1,A). [resolve(3,c,4,e)]. 13.09/13.39 Derived: r1(c1,c11) | -r1(c1,f21(A)) | p2(B) | -p2(f20(B)) | -r1(c1,B) | -r1(c1,A). [resolve(3,c,5,e)]. 13.09/13.39 Derived: r1(c1,c11) | -r1(c1,f21(A)) | p2(B) | r1(f19(B),f20(B)) | -r1(c1,B) | -r1(c1,A). [resolve(3,c,6,e)]. 13.09/13.39 Derived: r1(c1,c11) | -r1(c1,f21(A)) | p2(B) | r1(B,f19(B)) | -r1(c1,B) | -r1(c1,A). [resolve(3,c,7,e)]. 13.09/13.39 Derived: r1(c1,c11) | -r1(c1,f21(A)) | -p2(c9) | -r1(c1,A). [resolve(3,c,8,c)]. 13.09/13.39 Derived: r1(c1,c11) | -r1(c1,f21(A)) | r1(c1,c9) | -r1(c1,A). [resolve(3,c,9,c)]. 13.09/13.39 10 -p2(c11) | -r1(c1,A) | -p3(A) # label(main) # label(negated_conjecture). [clausify(2)]. 13.09/13.39 Derived: -p2(c11) | -r1(c1,f21(A)) | p2(B) | p2(f19(B)) | -r1(c1,B) | -r1(c1,A). [resolve(10,c,4,e)]. 13.09/13.39 Derived: -p2(c11) | -r1(c1,f21(A)) | p2(B) | -p2(f20(B)) | -r1(c1,B) | -r1(c1,A). [resolve(10,c,5,e)]. 13.09/13.39 Derived: -p2(c11) | -r1(c1,f21(A)) | p2(B) | r1(f19(B),f20(B)) | -r1(c1,B) | -r1(c1,A). [resolve(10,c,6,e)]. 13.09/13.39 Derived: -p2(c11) | -r1(c1,f21(A)) | p2(B) | r1(B,f19(B)) | -r1(c1,B) | -r1(c1,A). [resolve(10,c,7,e)]. 13.09/13.39 Derived: -p2(c11) | -r1(c1,f21(A)) | -p2(c9) | -r1(c1,A). [resolve(10,c,8,c)]. 13.09/13.39 Derived: -p2(c11) | -r1(c1,f21(A)) | r1(c1,c9) | -r1(c1,A). [resolve(10,c,9,c)]. 13.09/13.39 11 -r1(c1,A) | -p2(f23(A)) | p2(A) | -r1(c1,B) | -p3(B) # label(main) # label(negated_conjecture). [clausify(2)]. 13.09/13.39 Derived: -r1(c1,A) | -p2(f23(A)) | p2(A) | -r1(c1,f21(B)) | p2(C) | p2(f19(C)) | -r1(c1,C) | -r1(c1,B). [resolve(11,e,4,e)]. 13.09/13.39 Derived: -r1(c1,A) | -p2(f23(A)) | p2(A) | -r1(c1,f21(B)) | p2(C) | -p2(f20(C)) | -r1(c1,C) | -r1(c1,B). [resolve(11,e,5,e)]. 13.09/13.39 Derived: -r1(c1,A) | -p2(f23(A)) | p2(A) | -r1(c1,f21(B)) | p2(C) | r1(f19(C),f20(C)) | -r1(c1,C) | -r1(c1,B). [resolve(11,e,6,e)]. 13.09/13.39 Derived: -r1(c1,A) | -p2(f23(A)) | p2(A) | -r1(c1,f21(B)) | p2(C) | r1(C,f19(C)) | -r1(c1,C) | -r1(c1,B). [resolve(11,e,7,e)]. 13.09/13.39 Derived: -r1(c1,A) | -p2(f23(A)) | p2(A) | -r1(c1,f21(B)) | -p2(c9) | -r1(c1,B). [resolve(11,e,8,c)]. 13.09/13.39 Derived: -r1(c1,A) | -p2(f23(A)) | p2(A) | -r1(c1,f21(B)) | r1(c1,c9) | -r1(c1,B). [resolve(11,e,9,c)]. 13.09/13.39 12 -r1(c1,A) | r1(f22(A),f23(A)) | p2(A) | -r1(c1,B) | -p3(B) # label(main) # label(negated_conjecture). [clausify(2)]. 13.09/13.39 Derived: -r1(c1,A) | r1(f22(A),f23(A)) | p2(A) | -r1(c1,f21(B)) | p2(C) | p2(f19(C)) | -r1(c1,C) | -r1(c1,B). [resolve(12,e,4,e)]. 13.09/13.39 Derived: -r1(c1,A) | r1(f22(A),f23(A)) | p2(A) | -r1(c1,f21(B)) | p2(C) | -p2(f20(C)) | -r1(c1,C) | -r1(c1,B). [resolve(12,e,5,e)]. 13.09/13.39 Derived: -r1(c1,A) | r1(f22(A),f23(A)) | p2(A) | -r1(c1,f21(B)) | p2(C) | r1(f19(C),f20(C)) | -r1(c1,C) | -r1(c1,B). [resolve(12,e,6,e)]. 13.09/13.39 Derived: -r1(c1,A) | r1(f22(A),f23(A)) | p2(A) | -r1(c1,f21(B)) | p2(C) | r1(C,f19(C)) | -r1(c1,C) | -r1(c1,B). [resolve(12,e,7,e)]. 13.09/13.39 Derived: -r1(c1,A) | r1(f22(A),f23(A)) | p2(A) | -r1(c1,f21(B)) | -p2(c9) | -r1(c1,B). [resolve(12,e,8,c)]. 13.09/13.39 Derived: -r1(c1,A) | r1(f22(A),f23(A)) | p2(A) | -r1(c1,f21(B)) | r1(c1,c9) | -r1(c1,B). [resolve(12,e,9,c)]. 13.09/13.39 13 -r1(c1,A) | p2(f22(A)) | p2(A) | -r1(c1,B) | -p3(B) # label(main) # labeAlarm clock 119.55/120.04 Prover9 interrupted 119.55/120.04 EOF