0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n011.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 180 0.12/0.33 % DateTime : Thu Aug 29 09:31:42 EDT 2019 0.12/0.33 % CPUTime : 0.75/1.03 ============================== Prover9 =============================== 0.75/1.03 Prover9 (32) version 2009-11A, November 2009. 0.75/1.03 Process 24193 was started by sandbox2 on n011.cluster.edu, 0.75/1.03 Thu Aug 29 09:31:43 2019 0.75/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_24040_n011.cluster.edu". 0.75/1.03 ============================== end of head =========================== 0.75/1.03 0.75/1.03 ============================== INPUT ================================= 0.75/1.03 0.75/1.03 % Reading from file /tmp/Prover9_24040_n011.cluster.edu 0.75/1.03 0.75/1.03 set(prolog_style_variables). 0.75/1.03 set(auto2). 0.75/1.03 % set(auto2) -> set(auto). 0.75/1.03 % set(auto) -> set(auto_inference). 0.75/1.03 % set(auto) -> set(auto_setup). 0.75/1.03 % set(auto_setup) -> set(predicate_elim). 0.75/1.03 % set(auto_setup) -> assign(eq_defs, unfold). 0.75/1.03 % set(auto) -> set(auto_limits). 0.75/1.03 % set(auto_limits) -> assign(max_weight, "100.000"). 0.75/1.03 % set(auto_limits) -> assign(sos_limit, 20000). 0.75/1.03 % set(auto) -> set(auto_denials). 0.75/1.03 % set(auto) -> set(auto_process). 0.75/1.03 % set(auto2) -> assign(new_constants, 1). 0.75/1.03 % set(auto2) -> assign(fold_denial_max, 3). 0.75/1.03 % set(auto2) -> assign(max_weight, "200.000"). 0.75/1.03 % set(auto2) -> assign(max_hours, 1). 0.75/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.75/1.03 % set(auto2) -> assign(max_seconds, 0). 0.75/1.03 % set(auto2) -> assign(max_minutes, 5). 0.75/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.75/1.03 % set(auto2) -> set(sort_initial_sos). 0.75/1.03 % set(auto2) -> assign(sos_limit, -1). 0.75/1.03 % set(auto2) -> assign(lrs_ticks, 3000). 0.75/1.03 % set(auto2) -> assign(max_megs, 400). 0.75/1.03 % set(auto2) -> assign(stats, some). 0.75/1.03 % set(auto2) -> clear(echo_input). 0.75/1.03 % set(auto2) -> set(quiet). 0.75/1.03 % set(auto2) -> clear(print_initial_clauses). 0.75/1.03 % set(auto2) -> clear(print_given). 0.75/1.03 assign(lrs_ticks,-1). 0.75/1.03 assign(sos_limit,10000). 0.75/1.03 assign(order,kbo). 0.75/1.03 set(lex_order_vars). 0.75/1.03 clear(print_given). 0.75/1.03 0.75/1.03 % formulas(sos). % not echoed (33 formulas) 0.75/1.03 0.75/1.03 ============================== end of input ========================== 0.75/1.03 0.75/1.03 % From the command line: assign(max_seconds, 180). 0.75/1.03 0.75/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.75/1.03 0.75/1.03 % Formulas that are not ordinary clauses: 0.75/1.03 1 (all Ax all C ((exists I2 model(I2,C)) & -(exists I1 model(I1,Ax)) <-> status(Ax,C,sca))) # label(sca) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 2 (all Ax all C ((all I1 (model(I1,C) & model(I1,Ax))) <-> status(Ax,C,tau))) # label(tau) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 3 (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.75/1.03 4 (all Ax all C (status(Ax,C,wec) <-> (exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) -> model(I2,C))) & (exists I3 (model(I3,C) & -model(I3,Ax))))) # label(wec) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 5 (all Ax all C ((all I2 model(I2,not(C))) & (all I1 model(I1,Ax)) <-> status(Ax,C,uns))) # label(uns) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 6 (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.75/1.03 7 (all Ax all C (status(Ax,C,wca) <-> (exists I3 -model(I3,C)) & (exists I2 model(I2,C)) & -(exists I1 model(I1,Ax)))) # label(wca) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 8 (all Ax all C ((all I2 model(I2,C)) & (exists I1 model(I1,Ax)) <-> status(Ax,C,tac))) # label(tac) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 9 (all Ax all C ((exists I2 -model(I2,Ax)) & (all I3 (model(I3,Ax) <-> model(I3,C))) & (exists I1 model(I1,Ax)) <-> status(Ax,C,eth))) # label(eth) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 10 (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.75/1.03 11 (all Ax all C ((-(exists I1 model(I1,Ax)) -> -(exists I2 model(I2,C))) <-> status(Ax,C,unp))) # label(unp) # label(axiom) # label(non_clause). [assumption]. 0.75/1.03 12 (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.75/1.04 13 (all Ax all C (-(exists I1 model(I1,Ax)) <-> status(Ax,C,cax))) # label(cax) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 14 (all Ax all C (((exists I1 model(I1,Ax)) <-> (exists I2 model(I2,C))) <-> status(Ax,C,esa))) # label(esa) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 15 (all Ax all C (status(Ax,C,noc) <-> (exists I2 (model(I2,not(C)) & model(I2,Ax))) & (exists I1 (model(I1,C) & model(I1,Ax))))) # label(noc) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 16 (all Ax all C ((exists I1 (model(I1,not(C)) & model(I1,Ax))) <-> status(Ax,C,csa))) # label(csa) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 17 (all Ax all C ((exists I1 (model(I1,C) & model(I1,Ax))) <-> status(Ax,C,sat))) # label(sat) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 18 (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.75/1.04 19 (all Ax all C (status(Ax,C,eqv) <-> (exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) <-> model(I2,C))))) # label(eqv) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 20 (exists Ax exists C ((exists I1 (model(I1,C) & model(I1,Ax))) & (exists I2 (-model(I2,Ax) | -model(I2,C))))) # label(sat_non_taut_pair) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 21 (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.75/1.04 22 (all S1 all S2 (xora(S1,S2) <-> (all Ax all C -(status(Ax,C,S1) <-> status(Ax,C,S2))))) # label(xora) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 23 (all I all F (model(I,F) <-> -model(I,not(F)))) # label(not) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 24 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 25 (exists I1 exists Ax exists C (model(I1,Ax) & (exists I2 model(I2,C)) & -model(I1,C))) # label(non_thm_spt) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 26 (exists F ((exists I2 -model(I2,F)) & (exists I1 model(I1,F)))) # label(satisfiable) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 27 (exists Ax exists C ((exists I4 -model(I4,C)) & (exists I3 (model(I3,C) & -model(I3,Ax))) & (all I2 (model(I2,Ax) -> model(I2,C))) & (exists I1 model(I1,Ax)))) # label(mixed_pair) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 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.75/1.04 29 (all I all F -(model(I,F) <-> model(I,not(F)))) # label(completeness) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 30 (all S1 all S2 ((exists Ax exists C (-status(Ax,C,S2) & status(Ax,C,S1))) <-> nota(S1,S2))) # label(nota) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 31 (all S1 all S2 ((all Ax all C (status(Ax,C,S1) -> status(Ax,C,S2))) <-> isa(S1,S2))) # label(isa) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 32 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause). [assumption]. 0.75/1.04 0.75/1.04 ============================== end of process non-clausal formulas === 0.75/1.04 0.75/1.04 ============================== PROCESS INITIAL CLAUSES =============== 0.75/1.04 0.75/1.04 ============================== PREDICATE ELIMINATION ================= 0.75/1.04 33 nevera(A,B) | status(f42(A,B),f43(A,B),A) # label(nevera) # label(axiom). [clausify(21)]. 0.75/1.04 34 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom). [clausify(21)]. 0.75/1.04 Derived: status(f42(A,B),f43(A,B),A) | -status(C,D,A) | -status(C,D,B). [resolve(33,a,34,a)]. 0.75/1.04 35 nevera(A,B) | status(f42(A,B),f43(A,B),B) # label(nevera) # label(axiom). [clausify(21)]. 0.75/1.04 Derived: status(f42(A,B),f43(A,B),B) | -status(C,D,A) | -status(C,D,B). [resolve(35,a,34,a)]. 0.75/1.04 36 -nevera(noc,thm) # label(nevera_noc_thm) # label(negated_conjecture). [assumption]. 0.75/1.04 Derived: status(f42(noc,thm),f43(noc,thm),noc). [resolve(36,a,33,a)]. 0.75/1.04 Derived: status(f42(noc,thm),f43(noc,thm),thm). [resolve(36,a,35,a)]. 2.44/2.73 37 xora(A,B) | -status(f44(A,B),f45(A,B),A) | status(f44(A,B),f45(A,B),B) # label(xora) # label(axiom). [clausify(22)]. 2.44/2.73 38 -xora(A,B) | status(C,D,A) | status(C,D,B) # label(xora) # label(axiom). [clausify(22)]. 2.44/2.73 39 -xora(A,B) | -status(C,D,A) | -status(C,D,B) # label(xora) # label(axiom). [clausify(22)]. 2.44/2.73 Derived: -status(f44(A,B),f45(A,B),A) | status(f44(A,B),f45(A,B),B) | status(C,D,A) | status(C,D,B). [resolve(37,a,38,a)]. 2.44/2.73 Derived: -status(f44(A,B),f45(A,B),A) | status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B). [resolve(37,a,39,a)]. 2.44/2.73 40 xora(A,B) | status(f44(A,B),f45(A,B),A) | -status(f44(A,B),f45(A,B),B) # label(xora) # label(axiom). [clausify(22)]. 2.44/2.73 Derived: status(f44(A,B),f45(A,B),A) | -status(f44(A,B),f45(A,B),B) | status(C,D,A) | status(C,D,B). [resolve(40,a,38,a)]. 2.44/2.73 Derived: status(f44(A,B),f45(A,B),A) | -status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B). [resolve(40,a,39,a)]. 2.44/2.73 41 status(f46(A,B),f47(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom). [clausify(28)]. 2.44/2.73 42 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom). [clausify(28)]. 2.44/2.73 Derived: status(f46(A,B),f47(A,B),A) | -status(C,D,A) | -status(C,D,B). [resolve(41,b,42,c)]. 2.44/2.73 43 status(f46(A,B),f47(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom). [clausify(28)]. 2.44/2.73 Derived: status(f46(A,B),f47(A,B),B) | -status(C,D,A) | -status(C,D,B). [resolve(43,b,42,c)]. 2.44/2.73 44 -status(f48(A,B),f49(A,B),B) | -nota(A,B) # label(nota) # label(axiom). [clausify(30)]. 2.44/2.73 45 status(A,B,C) | -status(A,B,D) | nota(D,C) # label(nota) # label(axiom). [clausify(30)]. 2.44/2.73 Derived: -status(f48(A,B),f49(A,B),B) | status(C,D,B) | -status(C,D,A). [resolve(44,b,45,c)]. 2.44/2.73 46 status(f48(A,B),f49(A,B),A) | -nota(A,B) # label(nota) # label(axiom). [clausify(30)]. 2.44/2.73 Derived: status(f48(A,B),f49(A,B),A) | status(C,D,B) | -status(C,D,A). [resolve(46,b,45,c)]. 2.44/2.73 47 -status(A,B,C) | status(A,B,D) | -isa(C,D) # label(isa) # label(axiom). [clausify(31)]. 2.44/2.73 48 status(f50(A,B),f51(A,B),A) | isa(A,B) # label(isa) # label(axiom). [clausify(31)]. 2.44/2.73 49 -status(f50(A,B),f51(A,B),B) | isa(A,B) # label(isa) # label(axiom). [clausify(31)]. 2.44/2.73 Derived: -status(A,B,C) | status(A,B,D) | status(f50(C,D),f51(C,D),C). [resolve(47,c,48,b)]. 2.44/2.73 Derived: -status(A,B,C) | status(A,B,D) | -status(f50(C,D),f51(C,D),D). [resolve(47,c,49,b)]. 2.44/2.73 2.44/2.73 ============================== end predicate elimination ============= 2.44/2.73 2.44/2.73 Auto_denials: (non-Horn, no changes). 2.44/2.73 2.44/2.73 Term ordering decisions: 2.44/2.73 2.44/2.73 % Assigning unary symbol not kb_weight 0 and highest precedence (91). 2.44/2.73 Function symbol KB weights: noc=1. thm=1. eqv=1. eth=1. wec=1. wth=1. esa=1. csa=1. sap=1. sat=1. tac=1. tau=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. 2.44/2.73 2.44/2.73 ============================== end of process initial clauses ======== 2.44/2.73 2.44/2.73 ============================== CLAUSES FOR SEARCH ==================== 2.44/2.73 2.44/2.73 ============================== end of clauses for search ============= 2.44/2.73 2.44/2.73 ============================== SEARCH ================================ 2.44/2.73 2.44/2.73 % Starting search at 0.04 seconds. 2.44/2.73 2.44/2.73 Low Water (keep): wt=21.000, iters=3340 2.44/2.73 2.44/2.73 Low Water (keep): wt=20.000, iters=3522 2.44/2.73 2.44/2.73 Low Water (keep): wt=18.000, iters=3335 2.44/2.73 2.44/2.73 Low Water (keep): wt=17.000, iters=3348 2.44/2.73 2.44/2.73 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 51 (0.00 of 0.92 sec). 2.44/2.73 2.44/2.73 Low Water (keep): wt=16.000, iters=3342 2.44/2.73 2.44/2.73 Low Water (keep): wt=15.000, iters=3341 2.44/2.73 2.44/2.73 Low Water (keep): wt=14.000, iters=3345 2.44/2.73 2.44/2.73 Low Water (keep): wt=13.000, iters=3442 2.44/2.73 2.44/2.73 Low Water (displace): id=11031, wt=11.000 2.44/2.73 2.44/2.73 Low Water (displace): id=11038, wt=10.000 2.44/2.73 2.44/2.73 Low Water (displace): id=11039, wt=9.000 2.44/2.73 2.44/2.73 Low Water (keep): wt=12.000, iters=3355 2.57/2.89 2.57/2.89 Low Water (displace): id=13706, wt=8.000 2.57/2.89 2.57/2.89 ============================== PROOF ================================= 2.57/2.89 % SZS status Theorem 2.57/2.89 % SZS output start Refutation 2.57/2.89 2.57/2.89 % Proof 1 at 1.80 (+ 0.07) seconds. 2.57/2.89 % Length of proof is 18. 2.57/2.89 % Level of proof is 5. 2.57/2.89 % Maximum clause weight is 12.000. 2.57/2.89 % Given clauses 1416. 2.57/2.89 2.57/2.89 12 (all Ax all C ((all I1 (model(I1,Ax) -> model(I1,C))) <-> status(Ax,C,thm))) # label(thm) # label(axiom) # label(non_clause). [assumption]. 2.57/2.89 15 (all Ax all C (status(Ax,C,noc) <-> (exists I2 (model(I2,not(C)) & model(I2,Ax))) & (exists I1 (model(I1,C) & model(I1,Ax))))) # label(noc) # label(axiom) # label(non_clause). [assumption]. 2.57/2.89 21 (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]. 2.57/2.89 23 (all I all F (model(I,F) <-> -model(I,not(F)))) # label(not) # label(axiom) # label(non_clause). [assumption]. 2.57/2.89 33 nevera(A,B) | status(f42(A,B),f43(A,B),A) # label(nevera) # label(axiom). [clausify(21)]. 2.57/2.89 35 nevera(A,B) | status(f42(A,B),f43(A,B),B) # label(nevera) # label(axiom). [clausify(21)]. 2.57/2.89 36 -nevera(noc,thm) # label(nevera_noc_thm) # label(negated_conjecture). [assumption]. 2.57/2.89 97 -model(A,B) | model(A,C) | -status(B,C,thm) # label(thm) # label(axiom). [clausify(12)]. 2.57/2.89 104 -status(A,B,noc) | model(f34(A,B),not(B)) # label(noc) # label(axiom). [clausify(15)]. 2.57/2.89 105 -status(A,B,noc) | model(f34(A,B),A) # label(noc) # label(axiom). [clausify(15)]. 2.57/2.89 126 -model(A,B) | -model(A,not(B)) # label(not) # label(axiom). [clausify(23)]. 2.57/2.89 142 status(f42(noc,thm),f43(noc,thm),noc). [resolve(36,a,33,a)]. 2.57/2.89 143 status(f42(noc,thm),f43(noc,thm),thm). [resolve(36,a,35,a)]. 2.57/2.89 501 model(f34(f42(noc,thm),f43(noc,thm)),f42(noc,thm)). [resolve(142,a,105,a)]. 2.57/2.89 502 model(f34(f42(noc,thm),f43(noc,thm)),not(f43(noc,thm))). [resolve(142,a,104,a)]. 2.57/2.89 507 -model(A,f42(noc,thm)) | model(A,f43(noc,thm)). [resolve(143,a,97,c)]. 2.57/2.89 13882 -model(f34(f42(noc,thm),f43(noc,thm)),f43(noc,thm)). [resolve(502,a,126,b)]. 2.57/2.89 13900 $F. [resolve(507,a,501,a),unit_del(a,13882)]. 2.57/2.89 2.57/2.89 % SZS output end Refutation 2.57/2.89 ============================== end of proof ========================== 2.57/2.89 2.57/2.89 ============================== STATISTICS ============================ 2.57/2.89 2.57/2.89 Given=1416. Generated=118107. Kept=13850. proofs=1. 2.57/2.89 Usable=1416. Sos=9987. Demods=0. Limbo=0, Disabled=2570. Hints=0. 2.57/2.89 Megabytes=15.65. 2.57/2.89 User_CPU=1.80, System_CPU=0.07, Wall_clock=1. 2.57/2.89 2.57/2.89 ============================== end of statistics ===================== 2.57/2.89 2.57/2.89 ============================== end of search ========================= 2.57/2.89 2.57/2.89 THEOREM PROVED 2.57/2.89 % SZS status Theorem 2.57/2.89 2.57/2.89 Exiting with 1 proof. 2.57/2.89 2.57/2.89 Process 24193 exit (max_proofs) Thu Aug 29 09:31:44 2019 2.57/2.89 Prover9 interrupted 2.57/2.89 EOF