0.07/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s 0.14/0.35 % Computer : n022.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 : 180 0.14/0.35 % DateTime : Thu Aug 29 11:30:43 EDT 2019 0.14/0.35 % CPUTime : 6.14/6.46 ============================== Prover9 =============================== 6.14/6.46 Prover9 (32) version 2009-11A, November 2009. 6.14/6.46 Process 12352 was started by sandbox on n022.cluster.edu, 6.14/6.46 Thu Aug 29 11:30:44 2019 6.14/6.46 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_12198_n022.cluster.edu". 6.14/6.46 ============================== end of head =========================== 6.14/6.46 6.14/6.46 ============================== INPUT ================================= 6.14/6.46 6.14/6.46 % Reading from file /tmp/Prover9_12198_n022.cluster.edu 6.14/6.46 6.14/6.46 set(prolog_style_variables). 6.14/6.46 set(auto2). 6.14/6.46 % set(auto2) -> set(auto). 6.14/6.46 % set(auto) -> set(auto_inference). 6.14/6.46 % set(auto) -> set(auto_setup). 6.14/6.46 % set(auto_setup) -> set(predicate_elim). 6.14/6.46 % set(auto_setup) -> assign(eq_defs, unfold). 6.14/6.46 % set(auto) -> set(auto_limits). 6.14/6.46 % set(auto_limits) -> assign(max_weight, "100.000"). 6.14/6.46 % set(auto_limits) -> assign(sos_limit, 20000). 6.14/6.46 % set(auto) -> set(auto_denials). 6.14/6.46 % set(auto) -> set(auto_process). 6.14/6.46 % set(auto2) -> assign(new_constants, 1). 6.14/6.46 % set(auto2) -> assign(fold_denial_max, 3). 6.14/6.46 % set(auto2) -> assign(max_weight, "200.000"). 6.14/6.46 % set(auto2) -> assign(max_hours, 1). 6.14/6.46 % assign(max_hours, 1) -> assign(max_seconds, 3600). 6.14/6.46 % set(auto2) -> assign(max_seconds, 0). 6.14/6.46 % set(auto2) -> assign(max_minutes, 5). 6.14/6.46 % assign(max_minutes, 5) -> assign(max_seconds, 300). 6.14/6.46 % set(auto2) -> set(sort_initial_sos). 6.14/6.46 % set(auto2) -> assign(sos_limit, -1). 6.14/6.46 % set(auto2) -> assign(lrs_ticks, 3000). 6.14/6.46 % set(auto2) -> assign(max_megs, 400). 6.14/6.46 % set(auto2) -> assign(stats, some). 6.14/6.46 % set(auto2) -> clear(echo_input). 6.14/6.46 % set(auto2) -> set(quiet). 6.14/6.46 % set(auto2) -> clear(print_initial_clauses). 6.14/6.46 % set(auto2) -> clear(print_given). 6.14/6.46 assign(lrs_ticks,-1). 6.14/6.46 assign(sos_limit,10000). 6.14/6.46 assign(order,kbo). 6.14/6.46 set(lex_order_vars). 6.14/6.46 clear(print_given). 6.14/6.46 6.14/6.46 % formulas(sos). % not echoed (3 formulas) 6.14/6.46 6.14/6.46 ============================== end of input ========================== 6.14/6.46 6.14/6.46 % From the command line: assign(max_seconds, 180). 6.14/6.46 6.14/6.46 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 6.14/6.46 6.14/6.46 % Formulas that are not ordinary clauses: 6.14/6.46 1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause). [assumption]. 6.14/6.46 2 (all X all Y all Z (r1(X,Y) & r1(Y,Z) -> r1(X,Z))) # label(transitivity) # label(axiom) # label(non_clause). [assumption]. 6.14/6.46 3 --(exists X -((all Y (p1(Y) | (all X (-(all Y (-r1(X,Y) | -p5(Y))) | -r1(Y,X))) | -r1(X,Y))) & ((all Y (p2(Y) | -r1(X,Y))) | -(all Y (-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | p2(Y))) | -p2(X))) | p2(Y) | -r1(X,Y)))) | (all Y (p3(Y) | -r1(X,Y))) | -(all Y (-(all X (-r1(Y,X) | -p1(X) | (all Y (p1(Y) | -r1(X,Y))))) | p1(Y) | -r1(X,Y))) | -((p4(X) | p3(X) | p2(X) | p1(X) | -(all Y (-r1(X,Y) | p3(Y) | p2(Y) | p1(Y) | (all X -r1(Y,X)) | -(all X (-(p2(X) | (all Y -r1(X,Y)) | p1(X) | p3(X) | p4(X)) | (all Y (-r1(X,Y) | p2(Y) | p1(Y) | (all X -r1(Y,X)) | p3(Y) | p4(Y))) | -r1(Y,X))) | p4(Y))) | (all Y -r1(X,Y))) & (p3(X) | p2(X) | p1(X) | -(all Y (-r1(X,Y) | p2(Y) | p1(Y) | (all X -r1(Y,X)) | -(all X (-r1(Y,X) | -(p1(X) | (all Y -r1(X,Y)) | p2(X) | p3(X)) | (all Y (p1(Y) | (all X -r1(Y,X)) | p2(Y) | p3(Y) | -r1(X,Y))))) | p3(Y))) | (all Y -r1(X,Y))) & (all Y (-r1(X,Y) | p2(Y) | -(all X (p2(X) | -(all Y ((all X (p2(X) | -r1(Y,X))) | -p2(Y) | -r1(X,Y))) | -r1(Y,X))))) & (p1(X) | -(all Y (-r1(X,Y) | -(all X (-r1(Y,X) | (all Y ((all X -r1(Y,X)) | p1(Y) | -r1(X,Y))) | -((all Y -r1(X,Y)) | p1(X)))) | (all X -r1(Y,X)) | p1(Y))) | (all Y -r1(X,Y))) & (-(all Y (p1(Y) | -(all X (-r1(Y,X) | (all Y ((all X -r1(Y,X)) | p1(Y) | p2(Y) | -r1(X,Y))) | -(p1(X) | (all Y -r1(X,Y)) | p2(X)))) | (all X -r1(Y,X)) | p2(Y) | -r1(X,Y))) | (all Y -r1(X,Y)) | p1(X) | p2(X)) & (-(all Y ((-(all X (-r1(Y,X) | p2(X) | -(all Y (-r1(X,Y) | -p2(Y) | (all X (p2(X) | -r1(Y,X))))))) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | p2(Y) | -(all X (-r1(Y,X) | -p2(X) | (all Y (p2(Y) | -r1(X,Y)))))))))) & (p2(Y) | -(all X ((all Y (p2(Y) | -r1(X,Y))) | -p2(X) | -r1(Y,X)))) | -(all X ((all Y (-r1(X,Y) | (-(all X (-r1(Y,X) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p2(X))) | -p2(Y))) | p2(X))) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | p2(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 (p2(Y) | -r1(X,Y)))))))) | -((-(all Y (-r1(X,Y) | -p2(Y) | (all X (-r1(Y,X) | p2(X))))) | p2(X)) & (-(all Y (-r1(X,Y) | p2(Y) | -(all X (-p2(X) | (all Y (-r1(X,Y) | p2(Y))) | -r1(Y,X))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | p2(X) | -(all Y ((all X (-r1(Y,X) | p2(X))) | -p2(Y) | -r1(X,Y))))))))) | -r1(Y,X))) | -r1(X,Y))) | (-(all Y (-p2(Y) | (all X (p2(X) | -r1(Y,X))) | -r1(X,Y))) | p2(X)) & ((all Y ((all X (p2(X) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p2(X))) | -p2(Y))) | -r1(Y,X))) | -r1(X,Y))) | -(all Y (-r1(X,Y) | p2(Y) | -(all X (-p2(X) | (all Y (p2(Y) | -r1(X,Y))) | -r1(Y,X)))))))) | (all Y (-r1(X,Y) | p1(Y))) | (-(all Y (p2(Y) | -(all X (-r1(Y,X) | -p2(X) | (all Y (-r1(X,Y) | p2(Y))))) | -r1(X,Y))) | (all Y (-r1(X,Y) | p2(Y)))) & -(all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -p5(X))))) | -(all Y (-(all X (-r1(Y,X) | -p3(X) | (all Y (p3(Y) | -r1(X,Y))))) | p3(Y) | -r1(X,Y))))) # label(main) # label(negated_conjecture) # label(non_clause). [assumption]. 14.26/14.55 14.26/14.55 ============================== end of process non-clausal formulas === 14.26/14.55 14.26/14.55 ============================== PROCESS INITIAL CLAUSES =============== 14.26/14.55 14.26/14.55 ============================== PREDICATE ELIMINATION ================= 14.26/14.55 4 p2(A) | r1(A,f23(A)) | -r1(c1,A) | -r1(c1,B) | p5(f25(B)) # label(main) # label(negated_conjecture). [clausify(3)]. 14.26/14.55 5 -r1(c3,A) | -p5(A) | -p2(c4) # label(main) # label(negated_conjecture). [clausify(3)]. 14.26/14.55 6 -r1(c3,A) | -p5(A) | r1(c1,c4) # label(main) # label(negated_conjecture). [clausify(3)]. 14.26/14.55 7 -r1(c3,A) | -p5(A) | r1(B,f1(B)) | p2(B) | -r1(c1,B) # label(main) # label(negated_conjecture). [clausify(3)]. 14.26/14.55 8 -r1(c3,A) | -p5(A) | r1(f1(B),f2(B)) | p2(B) | -r1(c1,B) # label(main) # label(negated_conjecture). [clausify(3)]. 14.26/14.55 9 -r1(c3,A) | -p5(A) | -p2(f2(B)) | p2(B) | -r1(c1,B) # label(main) # label(negated_conjecture). [clausify(3)]. 14.26/14.55 10 -r1(c3,A) | -p5(A) | p2(f1(B)) | p2(B) | -r1(c1,B) # label(main) # label(negated_conjecture). [clausify(3)]. 14.26/14.55 Derived: p2(A) | r1(A,f23(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | -p2(c4). [resolve(4,e,5,b)]. 14.26/14.55 Derived: p2(A) | r1(A,f23(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | r1(c1,c4). [resolve(4,e,6,b)]. 14.26/14.55 Derived: p2(A) | r1(A,f23(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | r1(C,f1(C)) | p2(C) | -r1(c1,C). [resolve(4,e,7,b)]. 14.26/14.55 Derived: p2(A) | r1(A,f23(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | r1(f1(C),f2(C)) | p2(C) | -r1(c1,C). [resolve(4,e,8,b)]. 14.26/14.55 Derived: p2(A) | r1(A,f23(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | -p2(f2(C)) | p2(C) | -r1(c1,C). [resolve(4,e,9,b)]. 14.26/14.55 Derived: p2(A) | r1(A,f23(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | p2(f1(C)) | p2(C) | -r1(c1,C). [resolve(4,e,10,b)]. 14.26/14.55 11 p2(A) | p2(f23(A)) | -r1(c1,A) | -r1(c1,B) | p5(f25(B)) # label(main) # label(negated_conjecture). [clausify(3)]. 14.26/14.55 Derived: p2(A) | p2(f23(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | -p2(c4). [resolve(11,e,5,b)]. 14.26/14.55 Derived: p2(A) | p2(f23(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | r1(c1,c4). [resolve(11,e,6,b)]. 14.26/14.55 Derived: p2(A) | p2(f23(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | r1(C,f1(C)) | p2(C) | -r1(c1,C). [resolve(11,e,7,b)]. 14.26/14.55 Derived: p2(A) | p2(f23(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | r1(f1(C),f2(C)) | p2(C) | -r1(c1,C). [resolve(11,e,8,b)]. 14.26/14.55 Derived: p2(A) | p2(f23(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | -p2(f2(C)) | p2(C) | -r1(c1,C). [resolve(11,e,9,b)]. 14.26/14.55 Derived: p2(A) | p2(f23(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | p2(f1(C)) | p2(C) | -r1(c1,C). [resolve(11,e,10,b)]. 14.26/14.55 12 p2(A) | r1(f23(A),f24(A)) | -r1(c1,A) | -r1(c1,B) | p5(f25(B)) # label(main) # label(negated_conjecture). [clausify(3)]. 14.26/14.55 Derived: p2(A) | r1(f23(A),f24(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | -p2(c4). [resolve(12,e,5,b)]. 14.26/14.55 Derived: p2(A) | r1(f23(A),f24(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | r1(c1,c4). [resolve(12,e,6,b)]. 14.26/14.55 Derived: p2(A) | r1(f23(A),f24(A)) | -r1(c1,A) | -r1(c1,B) | -r1(c3,f25(B)) | r1(C,Cputime limit exceeded (core dumped) 180.09/180.36 EOF