0.02/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.03/0.25 % Computer : n003.star.cs.uiowa.edu 0.03/0.25 % Model : x86_64 x86_64 0.03/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.25 % Memory : 32218.625MB 0.03/0.25 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.25 % CPULimit : 300 0.03/0.25 % DateTime : Sat Jul 14 05:07:09 CDT 2018 0.03/0.25 % CPUTime : 0.07/0.48 ============================== Prover9 =============================== 0.07/0.48 Prover9 (32) version 2009-11A, November 2009. 0.07/0.48 Process 14316 was started by sandbox on n003.star.cs.uiowa.edu, 0.07/0.48 Sat Jul 14 05:07:10 2018 0.07/0.48 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_14284_n003.star.cs.uiowa.edu". 0.07/0.48 ============================== end of head =========================== 0.07/0.48 0.07/0.48 ============================== INPUT ================================= 0.07/0.48 0.07/0.48 % Reading from file /tmp/Prover9_14284_n003.star.cs.uiowa.edu 0.07/0.48 0.07/0.48 set(prolog_style_variables). 0.07/0.48 set(auto2). 0.07/0.48 % set(auto2) -> set(auto). 0.07/0.48 % set(auto) -> set(auto_inference). 0.07/0.48 % set(auto) -> set(auto_setup). 0.07/0.48 % set(auto_setup) -> set(predicate_elim). 0.07/0.48 % set(auto_setup) -> assign(eq_defs, unfold). 0.07/0.48 % set(auto) -> set(auto_limits). 0.07/0.48 % set(auto_limits) -> assign(max_weight, "100.000"). 0.07/0.48 % set(auto_limits) -> assign(sos_limit, 20000). 0.07/0.48 % set(auto) -> set(auto_denials). 0.07/0.48 % set(auto) -> set(auto_process). 0.07/0.48 % set(auto2) -> assign(new_constants, 1). 0.07/0.48 % set(auto2) -> assign(fold_denial_max, 3). 0.07/0.48 % set(auto2) -> assign(max_weight, "200.000"). 0.07/0.48 % set(auto2) -> assign(max_hours, 1). 0.07/0.48 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.07/0.48 % set(auto2) -> assign(max_seconds, 0). 0.07/0.48 % set(auto2) -> assign(max_minutes, 5). 0.07/0.48 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.07/0.48 % set(auto2) -> set(sort_initial_sos). 0.07/0.48 % set(auto2) -> assign(sos_limit, -1). 0.07/0.48 % set(auto2) -> assign(lrs_ticks, 3000). 0.07/0.48 % set(auto2) -> assign(max_megs, 400). 0.07/0.48 % set(auto2) -> assign(stats, some). 0.07/0.48 % set(auto2) -> clear(echo_input). 0.07/0.48 % set(auto2) -> set(quiet). 0.07/0.48 % set(auto2) -> clear(print_initial_clauses). 0.07/0.48 % set(auto2) -> clear(print_given). 0.07/0.48 assign(lrs_ticks,-1). 0.07/0.48 assign(sos_limit,10000). 0.07/0.48 assign(order,kbo). 0.07/0.48 set(lex_order_vars). 0.07/0.48 clear(print_given). 0.07/0.48 0.07/0.48 % formulas(sos). % not echoed (19 formulas) 0.07/0.48 0.07/0.48 ============================== end of input ========================== 0.07/0.48 0.07/0.48 % From the command line: assign(max_seconds, 300). 0.07/0.48 0.07/0.48 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.07/0.48 0.07/0.48 % Formulas that are not ordinary clauses: 0.07/0.48 1 (all X1 all X2 all X3 all X4 (-id(X1,X3) | -r2(X3,X4) & -r2(X1,X2) | r2(X1,X2) & r2(X3,X4) | -id(X2,X4))) # label(axiom_B5) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 2 (all X2 exists Y1 all X1 exists Y2 exists Y3 (r2(X2,Y1) & r3(X1,Y1,Y3) & r4(Y2,X1,Y3) & r3(X1,X2,Y2))) # label(axiom_R6) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 3 (all X1 all X2 (-r1(X1) & -r1(X2) | r1(X1) & r1(X2) | -id(X1,X2))) # label(axiom_B4) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 4 (all X2 all X3 exists Y1 all X1 (id(X1,Y1) & r3(X2,X3,X1) | -id(X1,Y1) & -r3(X2,X3,X1))) # label(axiom_B10) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 5 (all X1 all X2 all X3 all X4 all X5 all X6 (r4(X1,X2,X3) & r4(X4,X5,X6) | -r4(X4,X5,X6) & -r4(X1,X2,X3) | -id(X3,X6) | -id(X2,X5) | -id(X1,X4))) # label(axiom_B7) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 6 (exists Y1 all X1 (id(X1,Y1) & r1(X1) | -r1(X1) & -id(X1,Y1))) # label(axiom_B8) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 7 (all X1 (r1(X1) | (exists Y1 r2(Y1,X1)))) # label(axiom_R4) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 8 (exists Y1 all X1 (r1(Y1) & r4(X1,Y1,X1))) # label(axiom_R2) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 9 (all X1 id(X1,X1)) # label(axiom_B1) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 10 (exists Y1 all X1 (r3(X1,Y1,Y1) & r1(Y1))) # label(axiom_R1) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 11 (all X1 all X2 (id(X2,X1) | -id(X1,X2))) # label(axiom_B2) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 12 (all X1 all X2 all X3 (id(X1,X3) | -id(X2,X3) | -id(X1,X2))) # label(axiom_B3) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 13 (all X1 exists Y1 (-r1(Y1) & r2(X1,Y1))) # label(axiom_R3) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 14 (all X2 exists Y1 all X1 (-r2(X2,Y1) | -r2(X1,Y1) | id(X1,X2))) # label(axiom_R7) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 15 (all X1 all X2Cputime limit exceeded (core dumped) 300.07/300.31 EOF