0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.02/0.24 % Computer : n158.star.cs.uiowa.edu 0.02/0.24 % Model : x86_64 x86_64 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.24 % Memory : 32218.625MB 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.24 % CPULimit : 300 0.02/0.24 % DateTime : Sat Jul 14 04:41:09 CDT 2018 0.02/0.24 % CPUTime : 0.07/0.48 ============================== Prover9 =============================== 0.07/0.48 Prover9 (32) version 2009-11A, November 2009. 0.07/0.48 Process 63578 was started by sandbox2 on n158.star.cs.uiowa.edu, 0.07/0.48 Sat Jul 14 04:41:10 2018 0.07/0.48 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_63546_n158.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_63546_n158.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 (33 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 Ax all C (status(Ax,C,unp) <-> (-(exists I1 model(I1,Ax)) -> -(exists I2 model(I2,C))))) # label(unp) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 2 (all Ax all C (status(Ax,C,wtc) <-> (exists I1 model(I1,Ax)) & (exists I2 -model(I2,Ax)) & (all I3 model(I3,C)))) # label(wtc) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 3 (all Ax all C (status(Ax,C,sap) <-> ((exists I1 model(I1,Ax)) -> (exists I2 model(I2,C))))) # label(sap) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 4 (all Ax all C (((exists I2 model(I2,C)) <-> (exists I1 model(I1,Ax))) <-> status(Ax,C,esa))) # label(esa) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 5 (all Ax all C ((all I1 (model(I1,Ax) -> model(I1,C))) <-> status(Ax,C,thm))) # label(thm) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 6 (all Ax all C (-(exists I1 model(I1,Ax)) & (exists I2 model(I2,C)) <-> status(Ax,C,sca))) # label(sca) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 7 (all Ax all C (status(Ax,C,wth) <-> (exists I1 model(I1,Ax)) & (exists I4 -model(I4,C)) & (exists I3 (model(I3,C) & -model(I3,Ax))) & (all I2 (model(I2,Ax) -> model(I2,C))))) # label(wth) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 8 (all Ax all C (status(Ax,C,eth) <-> (all I3 (model(I3,C) <-> model(I3,Ax))) & (exists I2 -model(I2,Ax)) & (exists I1 model(I1,Ax)))) # label(eth) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 9 (all Ax all C ((exists I1 (model(I1,Ax) & model(I1,C))) <-> status(Ax,C,sat))) # label(sat) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 10 (all Ax all C ((exists I3 -model(I3,C)) & (exists I2 model(I2,C)) & -(exists I1 model(I1,Ax)) <-> status(Ax,C,wca))) # label(wca) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 11 (all Ax all C ((exists I1 (model(I1,Ax) & model(I1,not(C)))) <-> status(Ax,C,csa))) # label(csa) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 12 (all Ax all C (status(Ax,C,cax) <-> -(exists I1 model(I1,Ax)))) # label(cax) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 13 (all Ax all C (status(Ax,C,tca) <-> -(exists I1 model(I1,Ax)) & (all I2 model(I2,C)))) # label(tca) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 14 (all Ax all C ((all I1 (model(I1,Ax) & model(I1,C))) <-> status(Ax,C,tau))) # label(tau) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 15 (all Ax all C (status(Ax,C,tac) <-> (exists I1 model(I1,Ax)) & (all I2 model(I2,C)))) # label(tac) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 16 (all Ax all C (status(Ax,C,uns) <-> (all I2 model(I2,not(C))) & (all I1 model(I1,Ax)))) # label(uns) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 17 (all Ax all C (status(Ax,C,wec) <-> (exists I1 model(I1,Ax)) & (exists I3 (-model(I3,Ax) & model(I3,C))) & (all I2 (model(I2,Ax) -> model(I2,C))))) # label(wec) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 18 (all Ax all C ((exists I1 (model(I1,C) & model(I1,Ax))) & (exists I2 (model(I2,Ax) & model(I2,not(C)))) <-> status(Ax,C,noc))) # label(noc) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 19 (all Ax all C (status(Ax,C,eqv) <-> (all I2 (model(I2,Ax) <-> model(I2,C))) & (exists I1 model(I1,Ax)))) # label(eqv) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 20 (all S1 all S2 ((all Ax all C -(status(Ax,C,S2) <-> status(Ax,C,S1))) <-> xora(S1,S2))) # label(xora) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 21 (exists I1 exists Ax exists C (-model(I1,C) & (exists I2 model(I2,C)) & model(I1,Ax))) # label(non_thm_spt) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 22 (all S1 all S2 (nevera(S1,S2) <-> (all Ax all C (status(Ax,C,S1) -> -status(Ax,C,S2))))) # label(nevera) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 23 (exists F ((exists I2 -model(I2,F)) & (exists I1 model(I1,F)))) # label(satisfiable) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 24 (all S1 all S2 (isa(S1,S2) <-> (all Ax all C (status(Ax,C,S1) -> status(Ax,C,S2))))) # label(isa) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 25 (all S1 all S2 (nota(S1,S2) <-> (exists Ax exists C (status(Ax,C,S1) & -status(Ax,C,S2))))) # label(nota) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 26 (exists Ax exists C ((exists I2 (-model(I2,C) | -model(I2,Ax))) & (exists I1 (model(I1,C) & model(I1,Ax))))) # label(sat_non_taut_pair) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 27 (exists Ax exists C ((all I2 (model(I2,Ax) -> model(I2,C))) & (exists I3 (-model(I3,Ax) & model(I3,C))) & (exists I4 -model(I4,C)) & (exists I1 model(I1,Ax)))) # label(mixed_pair) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 28 (all S1 all S2 ((exists Ax exists C (status(Ax,C,S1) & status(Ax,C,S2))) <-> mighta(S1,S2))) # label(mighta) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 29 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 30 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 31 (all I all F (-model(I,not(F)) <-> model(I,F))) # label(not) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 32 (all I all F -(model(I,F) <-> model(I,not(F)))) # label(completeness) # label(axiom) # label(non_clause). [assumption]. 0.07/0.48 0.07/0.48 ============================== end of process non-clausal formulas === 0.07/0.48 0.07/0.48 ============================== PROCESS INITIAL CLAUSES =============== 0.07/0.48 0.07/0.48 ============================== PREDICATE ELIMINATION ================= 0.07/0.48 33 status(A,B,C) | status(A,B,D) | -xora(D,C) # label(xora) # label(axiom). [clausify(20)]. 0.07/0.48 34 -status(f42(A,B),f43(A,B),B) | status(f42(A,B),f43(A,B),A) | xora(A,B) # label(xora) # label(axiom). [clausify(20)]. 0.07/0.48 35 status(f42(A,B),f43(A,B),B) | -status(f42(A,B),f43(A,B),A) | xora(A,B) # label(xora) # label(axiom). [clausify(20)]. 0.07/0.48 Derived: status(A,B,C) | status(A,B,D) | -status(f42(D,C),f43(D,C),C) | status(f42(D,C),f43(D,C),D). [resolve(33,c,34,c)]. 0.07/0.48 Derived: status(A,B,C) | status(A,B,D) | status(f42(D,C),f43(D,C),C) | -status(f42(D,C),f43(D,C),D). [resolve(33,c,35,c)]. 0.07/0.48 36 -status(A,B,C) | -status(A,B,D) | -xora(D,C) # label(xora) # label(axiom). [clausify(20)]. 1.78/1.99 Derived: -status(A,B,C) | -status(A,B,D) | -status(f42(D,C),f43(D,C),C) | status(f42(D,C),f43(D,C),D). [resolve(36,c,34,c)]. 1.78/1.99 Derived: -status(A,B,C) | -status(A,B,D) | status(f42(D,C),f43(D,C),C) | -status(f42(D,C),f43(D,C),D). [resolve(36,c,35,c)]. 1.78/1.99 37 nevera(A,B) | status(f44(A,B),f45(A,B),A) # label(nevera) # label(axiom). [clausify(22)]. 1.78/1.99 38 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom). [clausify(22)]. 1.78/1.99 Derived: status(f44(A,B),f45(A,B),A) | -status(C,D,A) | -status(C,D,B). [resolve(37,a,38,a)]. 1.78/1.99 39 nevera(A,B) | status(f44(A,B),f45(A,B),B) # label(nevera) # label(axiom). [clausify(22)]. 1.78/1.99 Derived: status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B). [resolve(39,a,38,a)]. 1.78/1.99 40 isa(A,B) | status(f46(A,B),f47(A,B),A) # label(isa) # label(axiom). [clausify(24)]. 1.78/1.99 41 -isa(A,B) | -status(C,D,A) | status(C,D,B) # label(isa) # label(axiom). [clausify(24)]. 1.78/1.99 Derived: status(f46(A,B),f47(A,B),A) | -status(C,D,A) | status(C,D,B). [resolve(40,a,41,a)]. 1.78/1.99 42 isa(A,B) | -status(f46(A,B),f47(A,B),B) # label(isa) # label(axiom). [clausify(24)]. 1.78/1.99 Derived: -status(f46(A,B),f47(A,B),B) | -status(C,D,A) | status(C,D,B). [resolve(42,a,41,a)]. 1.78/1.99 43 nota(A,B) | -status(C,D,A) | status(C,D,B) # label(nota) # label(axiom). [clausify(25)]. 1.78/1.99 44 -nota(A,B) | status(f48(A,B),f49(A,B),A) # label(nota) # label(axiom). [clausify(25)]. 1.78/1.99 45 -nota(A,B) | -status(f48(A,B),f49(A,B),B) # label(nota) # label(axiom). [clausify(25)]. 1.78/1.99 Derived: -status(A,B,C) | status(A,B,D) | status(f48(C,D),f49(C,D),C). [resolve(43,a,44,a)]. 1.78/1.99 Derived: -status(A,B,C) | status(A,B,D) | -status(f48(C,D),f49(C,D),D). [resolve(43,a,45,a)]. 1.78/1.99 46 status(f50(A,B),f51(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom). [clausify(28)]. 1.78/1.99 47 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom). [clausify(28)]. 1.78/1.99 Derived: status(f50(A,B),f51(A,B),A) | -status(C,D,A) | -status(C,D,B). [resolve(46,b,47,c)]. 1.78/1.99 48 status(f50(A,B),f51(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom). [clausify(28)]. 1.78/1.99 Derived: status(f50(A,B),f51(A,B),B) | -status(C,D,A) | -status(C,D,B). [resolve(48,b,47,c)]. 1.78/1.99 49 -mighta(eth,thm) # label(mighta_eth_thm) # label(negated_conjecture). [assumption]. 1.78/1.99 Derived: -status(A,B,eth) | -status(A,B,thm). [resolve(49,a,47,c)]. 1.78/1.99 1.78/1.99 ============================== end predicate elimination ============= 1.78/1.99 1.78/1.99 Auto_denials: (non-Horn, no changes). 1.78/1.99 1.78/1.99 Term ordering decisions: 1.78/1.99 1.78/1.99 % Assigning unary symbol not kb_weight 0 and highest precedence (91). 1.78/1.99 Function symbol KB weights: eqv=1. eth=1. noc=1. wec=1. wth=1. esa=1. csa=1. sap=1. sat=1. tac=1. tau=1. thm=1. unp=1. uns=1. wtc=1. sca=1. tca=1. wca=1. cax=1. c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=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. f28=1. f29=1. f30=1. f31=1. f32=1. f33=1. f34=1. f35=1. f36=1. f37=1. f38=1. f39=1. f40=1. f41=1. f42=1. f43=1. f44=1. f45=1. f46=1. f47=1. f48=1. f49=1. f50=1. f51=1. not=0. 1.78/1.99 1.78/1.99 ============================== end of process initial clauses ======== 1.78/1.99 1.78/1.99 ============================== CLAUSES FOR SEARCH ==================== 1.78/1.99 1.78/1.99 ============================== end of clauses for search ============= 1.78/1.99 1.78/1.99 ============================== SEARCH ================================ 1.78/1.99 1.78/1.99 % Starting search at 0.02 seconds. 1.78/1.99 1.78/1.99 Low Water (keep): wt=24.000, iters=3364 1.78/1.99 1.78/1.99 Low Water (keep): wt=21.000, iters=3356 1.78/1.99 1.78/1.99 Low Water (keep): wt=20.000, iters=3348 1.78/1.99 1.78/1.99 Low Water (keep): wt=18.000, iters=3341 1.78/1.99 1.78/1.99 Low Water (keep): wt=17.000, iters=3337 1.78/1.99 1.78/1.99 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 57 (0.00 of 0.83 sec). 1.78/1.99 1.78/1.99 Low Water (keep): wt=16.000, iters=3358 1.78/1.99 1.78/1.99 Low Water (keep): wt=15.000, iters=3337 1.78/1.99 1.78/1.99 Low Water (keep): wt=14.000, iters=3339 1.78/1.99 1.78/1.99 Low Water (keep): wt=13.000, iters=3376 1.78/1.99 1.78/1.99 Low Water (keep): wt=12.000, iters=3832 1.78/1.99 1.78/1.99 Low Water (displace): id=11105, wt=12.000 1.78/1.99 1.78/1.99 Low Water (displace): id=11108, wt=11.000 1.78/1.99 1.78/1.99 Low Water (displace): id=11210, wt=10.000 1.78/1.99 1.78/1.99 LCputime limit exceeded (core dumped) 300.06/300.31 EOF