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 : n020.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 : 960 0.12/0.33 % DateTime : Thu Jul 2 06:45:32 EDT 2020 0.12/0.33 % CPUTime : 0.81/1.30 ============================== Prover9 =============================== 0.81/1.30 Prover9 (32) version 2009-11A, November 2009. 0.81/1.30 Process 7072 was started by sandbox2 on n020.cluster.edu, 0.81/1.30 Thu Jul 2 06:45:33 2020 0.81/1.30 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_6873_n020.cluster.edu". 0.81/1.30 ============================== end of head =========================== 0.81/1.30 0.81/1.30 ============================== INPUT ================================= 0.81/1.30 0.81/1.30 % Reading from file /tmp/Prover9_6873_n020.cluster.edu 0.81/1.30 0.81/1.30 set(prolog_style_variables). 0.81/1.30 set(auto2). 0.81/1.30 % set(auto2) -> set(auto). 0.81/1.30 % set(auto) -> set(auto_inference). 0.81/1.30 % set(auto) -> set(auto_setup). 0.81/1.30 % set(auto_setup) -> set(predicate_elim). 0.81/1.30 % set(auto_setup) -> assign(eq_defs, unfold). 0.81/1.30 % set(auto) -> set(auto_limits). 0.81/1.30 % set(auto_limits) -> assign(max_weight, "100.000"). 0.81/1.30 % set(auto_limits) -> assign(sos_limit, 20000). 0.81/1.30 % set(auto) -> set(auto_denials). 0.81/1.30 % set(auto) -> set(auto_process). 0.81/1.30 % set(auto2) -> assign(new_constants, 1). 0.81/1.30 % set(auto2) -> assign(fold_denial_max, 3). 0.81/1.31 % set(auto2) -> assign(max_weight, "200.000"). 0.81/1.31 % set(auto2) -> assign(max_hours, 1). 0.81/1.31 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.81/1.31 % set(auto2) -> assign(max_seconds, 0). 0.81/1.31 % set(auto2) -> assign(max_minutes, 5). 0.81/1.31 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.81/1.31 % set(auto2) -> set(sort_initial_sos). 0.81/1.31 % set(auto2) -> assign(sos_limit, -1). 0.81/1.31 % set(auto2) -> assign(lrs_ticks, 3000). 0.81/1.31 % set(auto2) -> assign(max_megs, 400). 0.81/1.31 % set(auto2) -> assign(stats, some). 0.81/1.31 % set(auto2) -> clear(echo_input). 0.81/1.31 % set(auto2) -> set(quiet). 0.81/1.31 % set(auto2) -> clear(print_initial_clauses). 0.81/1.31 % set(auto2) -> clear(print_given). 0.81/1.31 assign(lrs_ticks,-1). 0.81/1.31 assign(sos_limit,10000). 0.81/1.31 assign(order,kbo). 0.81/1.31 set(lex_order_vars). 0.81/1.31 clear(print_given). 0.81/1.31 0.81/1.31 % formulas(sos). % not echoed (33 formulas) 0.81/1.31 0.81/1.31 ============================== end of input ========================== 0.81/1.31 0.81/1.31 % From the command line: assign(max_seconds, 960). 0.81/1.31 0.81/1.31 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.81/1.31 0.81/1.31 % Formulas that are not ordinary clauses: 0.81/1.31 1 (all Ax all C ((exists I3 (-model(I3,Ax) & model(I3,C))) & (exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) -> model(I2,C))) <-> status(Ax,C,wec))) # label(wec) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 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.81/1.31 3 (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.81/1.31 4 (all Ax all C (status(Ax,C,sca) <-> (exists I2 model(I2,C)) & -(exists I1 model(I1,Ax)))) # label(sca) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 5 (all Ax all C ((exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) <-> model(I2,C))) <-> status(Ax,C,eqv))) # label(eqv) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 6 (all Ax all C (status(Ax,C,thm) <-> (all I1 (model(I1,Ax) -> model(I1,C))))) # label(thm) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 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.81/1.31 8 (all Ax all C (status(Ax,C,cax) <-> -(exists I1 model(I1,Ax)))) # label(cax) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 9 (all Ax all C ((all I1 model(I1,Ax)) & (all I2 model(I2,not(C))) <-> status(Ax,C,uns))) # label(uns) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 10 (all Ax all C ((exists I2 model(I2,C)) & (exists I3 -model(I3,C)) & -(exists I1 model(I1,Ax)) <-> status(Ax,C,wca))) # label(wca) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 11 (all Ax all C (status(Ax,C,eth) <-> (all I3 (model(I3,Ax) <-> model(I3,C))) & (exists I1 model(I1,Ax)) & (exists I2 -model(I2,Ax)))) # label(eth) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 12 (all Ax all C ((exists I1 (model(I1,Ax) & model(I1,C))) & (exists I2 (model(I2,Ax) & model(I2,not(C)))) <-> status(Ax,C,noc))) # label(noc) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 13 (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.81/1.31 14 (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.81/1.31 15 (all Ax all C (status(Ax,C,tca) <-> (all I2 model(I2,C)) & -(exists I1 model(I1,Ax)))) # label(tca) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 16 (all Ax all C (((exists I1 model(I1,Ax)) -> (exists I2 model(I2,C))) <-> status(Ax,C,sap))) # label(sap) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 17 (all Ax all C (status(Ax,C,esa) <-> ((exists I1 model(I1,Ax)) <-> (exists I2 model(I2,C))))) # label(esa) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 18 (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.81/1.31 19 (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.81/1.31 20 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 21 (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.81/1.31 22 (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.81/1.31 23 (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.81/1.31 24 (exists F ((exists I1 model(I1,F)) & (exists I2 -model(I2,F)))) # label(satisfiable) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 25 (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.81/1.31 26 (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.81/1.31 27 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 28 (all S1 all S2 ((exists Ax exists C (status(Ax,C,S1) & -status(Ax,C,S2))) <-> nota(S1,S2))) # label(nota) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 29 (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.81/1.31 30 (all I all F -(model(I,F) <-> model(I,not(F)))) # label(completeness) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 31 (all I all F (-model(I,not(F)) <-> model(I,F))) # label(not) # label(axiom) # label(non_clause). [assumption]. 0.81/1.31 32 (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.81/1.31 0.81/1.31 ============================== end of process non-clausal formulas === 0.81/1.31 0.81/1.31 ============================== PROCESS INITIAL CLAUSES =============== 0.81/1.31 0.81/1.31 ============================== PREDICATE ELIMINATION ================= 0.81/1.31 33 -status(A,B,C) | status(A,B,D) | -isa(C,D) # label(isa) # label(axiom). [clausify(22)]. 0.81/1.31 34 status(f42(A,B),f43(A,B),A) | isa(A,B) # label(isa) # label(axiom). [clausify(22)]. 0.81/1.31 35 -status(f42(A,B),f43(A,B),B) | isa(A,B) # label(isa) # label(axiom). [clausify(22)]. 0.81/1.31 Derived: -status(A,B,C) | status(A,B,D) | status(f42(C,D),f43(C,D),C). [resolve(33,c,34,b)]. 0.81/1.31 Derived: -status(A,B,C) | status(A,B,D) | -status(f42(C,D),f43(C,D),D). [resolve(33,c,35,b)]. 0.81/1.31 36 nevera(A,B) | status(f44(A,B),f45(A,B),A) # label(nevera) # label(axiom). [clausify(23)]. 0.81/1.31 37 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom). [clausify(23)]. 0.81/1.31 Derived: status(f44(A,B),f45(A,B),A) | -status(C,D,A) | -status(C,D,B). [resolve(36,a,37,a)]. 1.12/1.63 38 nevera(A,B) | status(f44(A,B),f45(A,B),B) # label(nevera) # label(axiom). [clausify(23)]. 1.12/1.63 Derived: status(f44(A,B),f45(A,B),B) | -status(C,D,A) | -status(C,D,B). [resolve(38,a,37,a)]. 1.12/1.63 39 status(f46(A,B),f47(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom). [clausify(25)]. 1.12/1.63 40 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom). [clausify(25)]. 1.12/1.63 Derived: status(f46(A,B),f47(A,B),A) | -status(C,D,A) | -status(C,D,B). [resolve(39,b,40,c)]. 1.12/1.63 41 status(f46(A,B),f47(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom). [clausify(25)]. 1.12/1.63 Derived: status(f46(A,B),f47(A,B),B) | -status(C,D,A) | -status(C,D,B). [resolve(41,b,40,c)]. 1.12/1.63 42 status(A,B,C) | status(A,B,D) | -xora(D,C) # label(xora) # label(axiom). [clausify(26)]. 1.12/1.63 43 -status(f48(A,B),f49(A,B),B) | status(f48(A,B),f49(A,B),A) | xora(A,B) # label(xora) # label(axiom). [clausify(26)]. 1.12/1.63 44 status(f48(A,B),f49(A,B),B) | -status(f48(A,B),f49(A,B),A) | xora(A,B) # label(xora) # label(axiom). [clausify(26)]. 1.12/1.63 Derived: status(A,B,C) | status(A,B,D) | -status(f48(D,C),f49(D,C),C) | status(f48(D,C),f49(D,C),D). [resolve(42,c,43,c)]. 1.12/1.63 Derived: status(A,B,C) | status(A,B,D) | status(f48(D,C),f49(D,C),C) | -status(f48(D,C),f49(D,C),D). [resolve(42,c,44,c)]. 1.12/1.63 45 -status(A,B,C) | -status(A,B,D) | -xora(D,C) # label(xora) # label(axiom). [clausify(26)]. 1.12/1.63 Derived: -status(A,B,C) | -status(A,B,D) | -status(f48(D,C),f49(D,C),C) | status(f48(D,C),f49(D,C),D). [resolve(45,c,43,c)]. 1.12/1.63 Derived: -status(A,B,C) | -status(A,B,D) | status(f48(D,C),f49(D,C),C) | -status(f48(D,C),f49(D,C),D). [resolve(45,c,44,c)]. 1.12/1.63 46 status(f50(A,B),f51(A,B),A) | -nota(A,B) # label(nota) # label(axiom). [clausify(28)]. 1.12/1.63 47 -status(A,B,C) | status(A,B,D) | nota(C,D) # label(nota) # label(axiom). [clausify(28)]. 1.12/1.63 Derived: status(f50(A,B),f51(A,B),A) | -status(C,D,A) | status(C,D,B). [resolve(46,b,47,c)]. 1.12/1.63 48 -status(f50(A,B),f51(A,B),B) | -nota(A,B) # label(nota) # label(axiom). [clausify(28)]. 1.12/1.63 Derived: -status(f50(A,B),f51(A,B),B) | -status(C,D,A) | status(C,D,B). [resolve(48,b,47,c)]. 1.12/1.63 49 -nota(esa,thm) # label(nota_esa_thm) # label(negated_conjecture). [assumption]. 1.12/1.63 Derived: -status(A,B,esa) | status(A,B,thm). [resolve(49,a,47,c)]. 1.12/1.63 1.12/1.63 ============================== end predicate elimination ============= 1.12/1.63 1.12/1.63 Auto_denials: (non-Horn, no changes). 1.12/1.63 1.12/1.63 Term ordering decisions: 1.12/1.63 1.12/1.63 % Assigning unary symbol not kb_weight 0 and highest precedence (91). 1.12/1.63 Function symbol KB weights: eqv=1. esa=1. eth=1. noc=1. wec=1. wth=1. thm=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. 1.12/1.63 1.12/1.63 ============================== end of process initial clauses ======== 1.12/1.63 1.12/1.63 ============================== CLAUSES FOR SEARCH ==================== 1.12/1.63 1.12/1.63 ============================== end of clauses for search ============= 1.12/1.63 1.12/1.63 ============================== SEARCH ================================ 1.12/1.63 1.12/1.63 % Starting search at 0.03 seconds. 1.12/1.63 1.12/1.63 ============================== PROOF ================================= 1.12/1.63 % SZS status Theorem 1.12/1.63 % SZS output start Refutation 1.12/1.63 1.12/1.63 % Proof 1 at 0.34 (+ 0.00) seconds. 1.12/1.63 % Length of proof is 26. 1.12/1.63 % Level of proof is 7. 1.12/1.63 % Maximum clause weight is 10.000. 1.12/1.63 % Given clauses 202. 1.12/1.63 1.12/1.63 6 (all Ax all C (status(Ax,C,thm) <-> (all I1 (model(I1,Ax) -> model(I1,C))))) # label(thm) # label(axiom) # label(non_clause). [assumption]. 1.12/1.63 17 (all Ax all C (status(Ax,C,esa) <-> ((exists I1 model(I1,Ax)) <-> (exists I2 model(I2,C))))) # label(esa) # label(axiom) # label(non_clause). [assumption]. 1.12/1.63 21 (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]. 1.12/1.64 27 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause). [assumption]. 1.12/1.64 28 (all S1 all S2 ((exists Ax exists C (status(Ax,C,S1) & -status(Ax,C,S2))) <-> nota(S1,S2))) # label(nota) # label(axiom) # label(non_clause). [assumption]. 1.12/1.64 29 (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]. 1.12/1.64 47 -status(A,B,C) | status(A,B,D) | nota(C,D) # label(nota) # label(axiom). [clausify(28)]. 1.12/1.64 49 -nota(esa,thm) # label(nota_esa_thm) # label(negated_conjecture). [assumption]. 1.12/1.64 71 -status(A,B,thm) | -model(C,A) | model(C,B) # label(thm) # label(axiom). [clausify(6)]. 1.12/1.64 116 status(A,B,esa) | -model(C,A) | -model(D,B) # label(esa) # label(axiom). [clausify(17)]. 1.12/1.64 124 model(c2,c3) # label(non_thm_spt) # label(axiom). [clausify(21)]. 1.12/1.64 129 model(A,c9) # label(tautology) # label(axiom). [clausify(27)]. 1.12/1.64 130 -model(c12,c11) # label(mixed_pair) # label(axiom). [clausify(29)]. 1.12/1.64 133 -model(A,c10) | model(A,c11) # label(mixed_pair) # label(axiom). [clausify(29)]. 1.12/1.64 134 model(c14,c10) # label(mixed_pair) # label(axiom). [clausify(29)]. 1.12/1.64 152 -status(A,B,esa) | status(A,B,thm). [resolve(49,a,47,c)]. 1.12/1.64 181 status(A,c3,esa) | -model(B,A). [resolve(124,a,116,c)]. 1.12/1.64 182 status(c3,A,esa) | -model(B,A). [resolve(124,a,116,b)]. 1.12/1.64 324 model(c14,c11). [resolve(134,a,133,a)]. 1.12/1.64 1272 status(c9,c3,esa). [resolve(181,b,129,a)]. 1.12/1.64 1342 status(c3,c11,esa). [resolve(182,b,324,a)]. 1.12/1.64 1610 status(c9,c3,thm). [resolve(1272,a,152,a)]. 1.12/1.64 1668 status(c3,c11,thm). [resolve(1342,a,152,a)]. 1.12/1.64 1943 model(A,c3). [resolve(1610,a,71,a),unit_del(a,129)]. 1.12/1.64 2009 model(A,c11). [resolve(1668,a,71,a),unit_del(a,1943)]. 1.12/1.64 2010 $F. [resolve(2009,a,130,a)]. 1.12/1.64 1.12/1.64 % SZS output end Refutation 1.12/1.64 ============================== end of proof ========================== 1.12/1.64 1.12/1.64 ============================== STATISTICS ============================ 1.12/1.64 1.12/1.64 Given=202. Generated=2533. Kept=1960. proofs=1. 1.12/1.64 Usable=186. Sos=1576. Demods=0. Limbo=16, Disabled=303. Hints=0. 1.12/1.64 Megabytes=2.91. 1.12/1.64 User_CPU=0.34, System_CPU=0.00, Wall_clock=0. 1.12/1.64 1.12/1.64 ============================== end of statistics ===================== 1.12/1.64 1.12/1.64 ============================== end of search ========================= 1.12/1.64 1.12/1.64 THEOREM PROVED 1.12/1.64 % SZS status Theorem 1.12/1.64 1.12/1.64 Exiting with 1 proof. 1.12/1.64 1.12/1.64 Process 7072 exit (max_proofs) Thu Jul 2 06:45:33 2020 1.12/1.64 Prover9 interrupted 1.12/1.64 EOF