0.05/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.10 % Command : tptp2X_and_run_prover9 %d %s 0.09/0.30 % Computer : n023.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 960 0.09/0.30 % WCLimit : 120 0.09/0.30 % DateTime : Tue Aug 9 05:57:42 EDT 2022 0.09/0.30 % CPUTime : 0.68/1.01 ============================== Prover9 =============================== 0.68/1.01 Prover9 (32) version 2009-11A, November 2009. 0.68/1.01 Process 27353 was started by sandbox2 on n023.cluster.edu, 0.68/1.01 Tue Aug 9 05:57:43 2022 0.68/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_27200_n023.cluster.edu". 0.68/1.01 ============================== end of head =========================== 0.68/1.01 0.68/1.01 ============================== INPUT ================================= 0.68/1.01 0.68/1.01 % Reading from file /tmp/Prover9_27200_n023.cluster.edu 0.68/1.01 0.68/1.01 set(prolog_style_variables). 0.68/1.01 set(auto2). 0.68/1.01 % set(auto2) -> set(auto). 0.68/1.01 % set(auto) -> set(auto_inference). 0.68/1.01 % set(auto) -> set(auto_setup). 0.68/1.01 % set(auto_setup) -> set(predicate_elim). 0.68/1.01 % set(auto_setup) -> assign(eq_defs, unfold). 0.68/1.01 % set(auto) -> set(auto_limits). 0.68/1.01 % set(auto_limits) -> assign(max_weight, "100.000"). 0.68/1.01 % set(auto_limits) -> assign(sos_limit, 20000). 0.68/1.01 % set(auto) -> set(auto_denials). 0.68/1.01 % set(auto) -> set(auto_process). 0.68/1.01 % set(auto2) -> assign(new_constants, 1). 0.68/1.01 % set(auto2) -> assign(fold_denial_max, 3). 0.68/1.01 % set(auto2) -> assign(max_weight, "200.000"). 0.68/1.01 % set(auto2) -> assign(max_hours, 1). 0.68/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.68/1.01 % set(auto2) -> assign(max_seconds, 0). 0.68/1.01 % set(auto2) -> assign(max_minutes, 5). 0.68/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.68/1.01 % set(auto2) -> set(sort_initial_sos). 0.68/1.01 % set(auto2) -> assign(sos_limit, -1). 0.68/1.01 % set(auto2) -> assign(lrs_ticks, 3000). 0.68/1.01 % set(auto2) -> assign(max_megs, 400). 0.68/1.01 % set(auto2) -> assign(stats, some). 0.68/1.01 % set(auto2) -> clear(echo_input). 0.68/1.01 % set(auto2) -> set(quiet). 0.68/1.01 % set(auto2) -> clear(print_initial_clauses). 0.68/1.01 % set(auto2) -> clear(print_given). 0.68/1.01 assign(lrs_ticks,-1). 0.68/1.01 assign(sos_limit,10000). 0.68/1.01 assign(order,kbo). 0.68/1.01 set(lex_order_vars). 0.68/1.01 clear(print_given). 0.68/1.01 0.68/1.01 % formulas(sos). % not echoed (32 formulas) 0.68/1.01 0.68/1.01 ============================== end of input ========================== 0.68/1.01 0.68/1.01 % From the command line: assign(max_seconds, 960). 0.68/1.01 0.68/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.68/1.01 0.68/1.01 % Formulas that are not ordinary clauses: 0.68/1.01 1 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 2 (all A relation(identity_relation(A))) # label(dt_k6_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 3 (exists A (-empty(A) & relation(A))) # label(rc2_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 4 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 5 (all A all B unordered_pair(unordered_pair(A,B),singleton(A)) = ordered_pair(A,B)) # label(d5_tarski) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 6 (all A all B (empty(A) & relation(B) -> empty(relation_composition(B,A)) & relation(relation_composition(B,A)))) # label(fc10_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 7 (all A (empty(A) -> relation(A))) # label(cc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 8 $T # label(dt_k4_tarski) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 9 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 10 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 11 (all A all B -empty(unordered_pair(A,B))) # label(fc3_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 12 (all A all B (in(A,B) -> element(A,B))) # label(t1_subset) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 13 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 14 (all A -empty(singleton(A))) # label(fc2_subset_1) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 15 (exists A (empty(A) & relation(A))) # label(rc1_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 16 (all A all B (relation(B) -> ((all C all D (C = D & in(C,A) <-> in(ordered_pair(C,D),B))) <-> identity_relation(A) = B))) # label(d10_relat_1) # label(axiom) # label(non_clause). [assumption]. 0.68/1.01 17 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiomAlarm clock 119.31/120.03 Prover9 interrupted 119.31/120.03 EOF