0.14/0.15 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.14/0.15 % Command : tptp2X_and_run_prover9 %d %s 0.15/0.37 % Computer : n026.cluster.edu 0.15/0.37 % Model : x86_64 x86_64 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.37 % Memory : 8042.1875MB 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.37 % CPULimit : 960 0.15/0.37 % WCLimit : 120 0.15/0.37 % DateTime : Tue Aug 9 02:57:49 EDT 2022 0.15/0.37 % CPUTime : 0.95/1.21 ============================== Prover9 =============================== 0.95/1.21 Prover9 (32) version 2009-11A, November 2009. 0.95/1.21 Process 23208 was started by sandbox2 on n026.cluster.edu, 0.95/1.21 Tue Aug 9 02:57:50 2022 0.95/1.21 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_23043_n026.cluster.edu". 0.95/1.21 ============================== end of head =========================== 0.95/1.21 0.95/1.21 ============================== INPUT ================================= 0.95/1.21 0.95/1.21 % Reading from file /tmp/Prover9_23043_n026.cluster.edu 0.95/1.21 0.95/1.21 set(prolog_style_variables). 0.95/1.21 set(auto2). 0.95/1.21 % set(auto2) -> set(auto). 0.95/1.21 % set(auto) -> set(auto_inference). 0.95/1.21 % set(auto) -> set(auto_setup). 0.95/1.21 % set(auto_setup) -> set(predicate_elim). 0.95/1.21 % set(auto_setup) -> assign(eq_defs, unfold). 0.95/1.21 % set(auto) -> set(auto_limits). 0.95/1.21 % set(auto_limits) -> assign(max_weight, "100.000"). 0.95/1.21 % set(auto_limits) -> assign(sos_limit, 20000). 0.95/1.21 % set(auto) -> set(auto_denials). 0.95/1.21 % set(auto) -> set(auto_process). 0.95/1.21 % set(auto2) -> assign(new_constants, 1). 0.95/1.21 % set(auto2) -> assign(fold_denial_max, 3). 0.95/1.21 % set(auto2) -> assign(max_weight, "200.000"). 0.95/1.21 % set(auto2) -> assign(max_hours, 1). 0.95/1.21 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.95/1.21 % set(auto2) -> assign(max_seconds, 0). 0.95/1.21 % set(auto2) -> assign(max_minutes, 5). 0.95/1.21 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.95/1.21 % set(auto2) -> set(sort_initial_sos). 0.95/1.21 % set(auto2) -> assign(sos_limit, -1). 0.95/1.21 % set(auto2) -> assign(lrs_ticks, 3000). 0.95/1.21 % set(auto2) -> assign(max_megs, 400). 0.95/1.21 % set(auto2) -> assign(stats, some). 0.95/1.21 % set(auto2) -> clear(echo_input). 0.95/1.21 % set(auto2) -> set(quiet). 0.95/1.21 % set(auto2) -> clear(print_initial_clauses). 0.95/1.21 % set(auto2) -> clear(print_given). 0.95/1.21 assign(lrs_ticks,-1). 0.95/1.21 assign(sos_limit,10000). 0.95/1.21 assign(order,kbo). 0.95/1.21 set(lex_order_vars). 0.95/1.21 clear(print_given). 0.95/1.21 0.95/1.21 % formulas(sos). % not echoed (33 formulas) 0.95/1.21 0.95/1.21 ============================== end of input ========================== 0.95/1.21 0.95/1.21 % From the command line: assign(max_seconds, 960). 0.95/1.21 0.95/1.21 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.95/1.21 0.95/1.21 % Formulas that are not ordinary clauses: 0.95/1.21 1 (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.95/1.21 2 (all Ax all C (-(exists I1 model(I1,Ax)) & (all I2 model(I2,C)) <-> status(Ax,C,tca))) # label(tca) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 3 (all Ax all C ((exists I1 model(I1,Ax)) & (exists I3 (-model(I3,Ax) & model(I3,C))) & (all I2 (model(I2,Ax) -> model(I2,C))) <-> status(Ax,C,wec))) # label(wec) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 4 (all Ax all C ((exists I1 model(I1,Ax)) & (exists I2 -model(I2,Ax)) & (all I3 model(I3,C)) <-> status(Ax,C,wtc))) # label(wtc) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 5 (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.95/1.21 6 (all Ax all C (status(Ax,C,cax) <-> -(exists I1 model(I1,Ax)))) # label(cax) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 7 (all Ax all C ((exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) -> model(I2,C))) & (exists I3 (model(I3,C) & -model(I3,Ax))) & (exists I4 -model(I4,C)) <-> status(Ax,C,wth))) # label(wth) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 8 (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.95/1.21 9 (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.95/1.21 10 (all Ax all C (status(Ax,C,csa) <-> (exists I1 (model(I1,not(C)) & model(I1,Ax))))) # label(csa) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 11 (all Ax all C ((exists I1 model(I1,Ax)) & (exists I2 -model(I2,Ax)) & (all I3 (model(I3,C) <-> model(I3,Ax))) <-> status(Ax,C,eth))) # label(eth) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 12 (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.95/1.21 13 (all Ax all C ((exists I2 (model(I2,Ax) & model(I2,not(C)))) & (exists I1 (model(I1,C) & model(I1,Ax))) <-> status(Ax,C,noc))) # label(noc) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 14 (all Ax all C (status(Ax,C,tau) <-> (all I1 (model(I1,Ax) & model(I1,C))))) # label(tau) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 15 (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.95/1.21 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.95/1.21 17 (all Ax all C (status(Ax,C,sat) <-> (exists I1 (model(I1,C) & model(I1,Ax))))) # label(sat) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 18 (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.95/1.21 19 (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.95/1.21 20 (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.95/1.21 21 (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.95/1.21 22 (exists Ax exists C ((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(mixed_pair) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 23 (all I all F -(model(I,not(F)) <-> model(I,F))) # label(completeness) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 24 (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.95/1.21 25 (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.95/1.21 26 (all I all F (model(I,F) <-> -model(I,not(F)))) # label(not) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 27 (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.95/1.21 28 (all S1 all S2 (nota(S1,S2) <-> (exists Ax exists C (-status(Ax,C,S2) & status(Ax,C,S1))))) # label(nota) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 29 (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.95/1.21 30 (exists F all I -model(I,F)) # label(contradiction) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 31 (exists F all I model(I,F)) # label(tautology) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 32 (exists F ((exists I1 model(I1,F)) & (exists I2 -model(I2,F)))) # label(satisfiable) # label(axiom) # label(non_clause). [assumption]. 0.95/1.21 0.95/1.21 ============================== end of process non-clausal formulas === 0.95/1.21 0.95/1.21 ============================== PROCESS INITIAL CLAUSES =============== 0.95/1.21 0.95/1.21 ============================== PREDICATE ELIMINATION ================= 0.95/1.21 33 xora(A,B) | -status(f42(A,B),f43(A,B),A) | status(f42(A,B),f43(A,B),B) # label(xora) # label(axiom). [clausify(24)]. 0.95/1.21 34 -xora(A,B) | status(C,D,A) | status(C,D,B) # label(xora) # label(axiom). [clausify(24)]. 0.95/1.21 35 -xora(A,B) | -status(C,D,A) | -status(C,D,B) # label(xora) # label(axiom). [clausify(24)]. 0.95/1.21 Derived: -status(f42(A,B),f43(A,B),A) | status(f42(A,B),f43(A,B),B) | status(C,D,A) | status(C,D,B). [resolve(33,a,34,a)]. 0.95/1.21 Derived: -status(f42(A,B),f43(A,B),A) | status(f42(A,B),f43(A,B),B) | -status(C,D,A) | -status(C,D,B). [resolve(33,a,35,a)]. 0.95/1.21 36 xora(A,B) | status(f42(A,B),f43(A,B),A) | -status(f42(A,B),f43(A,B),B) # label(xora) # label(axiom). [clausify(24)]. 0.95/1.21 Derived: status(f42(A,B),f43(A,B),A) | -status(f42(A,B),f43(A,B),B) | status(C,D,A) | status(C,D,B). [resolve(36,a,34,a)]. 0.95/1.44 Derived: status(f42(A,B),f43(A,B),A) | -status(f42(A,B),f43(A,B),B) | -status(C,D,A) | -status(C,D,B). [resolve(36,a,35,a)]. 0.95/1.44 37 -status(A,B,C) | status(A,B,D) | -isa(C,D) # label(isa) # label(axiom). [clausify(25)]. 0.95/1.44 38 status(f44(A,B),f45(A,B),A) | isa(A,B) # label(isa) # label(axiom). [clausify(25)]. 0.95/1.44 39 -status(f44(A,B),f45(A,B),B) | isa(A,B) # label(isa) # label(axiom). [clausify(25)]. 0.95/1.44 Derived: -status(A,B,C) | status(A,B,D) | status(f44(C,D),f45(C,D),C). [resolve(37,c,38,b)]. 0.95/1.44 Derived: -status(A,B,C) | status(A,B,D) | -status(f44(C,D),f45(C,D),D). [resolve(37,c,39,b)]. 0.95/1.44 40 -isa(wtc,thm) # label(isa_wtc_thm) # label(negated_conjecture). [assumption]. 0.95/1.44 Derived: status(f44(wtc,thm),f45(wtc,thm),wtc). [resolve(40,a,38,b)]. 0.95/1.44 Derived: -status(f44(wtc,thm),f45(wtc,thm),thm). [resolve(40,a,39,b)]. 0.95/1.44 41 nevera(A,B) | status(f46(A,B),f47(A,B),A) # label(nevera) # label(axiom). [clausify(27)]. 0.95/1.44 42 -nevera(A,B) | -status(C,D,A) | -status(C,D,B) # label(nevera) # label(axiom). [clausify(27)]. 0.95/1.44 Derived: status(f46(A,B),f47(A,B),A) | -status(C,D,A) | -status(C,D,B). [resolve(41,a,42,a)]. 0.95/1.44 43 nevera(A,B) | status(f46(A,B),f47(A,B),B) # label(nevera) # label(axiom). [clausify(27)]. 0.95/1.44 Derived: status(f46(A,B),f47(A,B),B) | -status(C,D,A) | -status(C,D,B). [resolve(43,a,42,a)]. 0.95/1.44 44 nota(A,B) | status(C,D,B) | -status(C,D,A) # label(nota) # label(axiom). [clausify(28)]. 0.95/1.44 45 -nota(A,B) | -status(f48(A,B),f49(A,B),B) # label(nota) # label(axiom). [clausify(28)]. 0.95/1.44 46 -nota(A,B) | status(f48(A,B),f49(A,B),A) # label(nota) # label(axiom). [clausify(28)]. 0.95/1.44 Derived: status(A,B,C) | -status(A,B,D) | -status(f48(D,C),f49(D,C),C). [resolve(44,a,45,a)]. 0.95/1.44 Derived: status(A,B,C) | -status(A,B,D) | status(f48(D,C),f49(D,C),D). [resolve(44,a,46,a)]. 0.95/1.44 47 status(f50(A,B),f51(A,B),A) | -mighta(A,B) # label(mighta) # label(axiom). [clausify(29)]. 0.95/1.44 48 -status(A,B,C) | -status(A,B,D) | mighta(C,D) # label(mighta) # label(axiom). [clausify(29)]. 0.95/1.44 Derived: status(f50(A,B),f51(A,B),A) | -status(C,D,A) | -status(C,D,B). [resolve(47,b,48,c)]. 0.95/1.44 49 status(f50(A,B),f51(A,B),B) | -mighta(A,B) # label(mighta) # label(axiom). [clausify(29)]. 0.95/1.44 Derived: status(f50(A,B),f51(A,B),B) | -status(C,D,A) | -status(C,D,B). [resolve(49,b,48,c)]. 0.95/1.44 0.95/1.44 ============================== end predicate elimination ============= 0.95/1.44 0.95/1.44 Auto_denials: (non-Horn, no changes). 0.95/1.44 0.95/1.44 Term ordering decisions: 0.95/1.44 0.95/1.44 % Assigning unary symbol not kb_weight 0 and highest precedence (91). 0.95/1.44 Function symbol KB weights: wtc=1. eqv=1. eth=1. noc=1. thm=1. wec=1. wth=1. esa=1. csa=1. sap=1. sat=1. tac=1. tau=1. unp=1. uns=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. 0.95/1.44 0.95/1.44 ============================== end of process initial clauses ======== 0.95/1.44 0.95/1.44 ============================== CLAUSES FOR SEARCH ==================== 0.95/1.44 0.95/1.44 ============================== end of clauses for search ============= 0.95/1.44 0.95/1.44 ============================== SEARCH ================================ 0.95/1.44 0.95/1.44 % Starting search at 0.03 seconds. 0.95/1.44 0.95/1.44 ============================== PROOF ================================= 0.95/1.44 % SZS status Theorem 0.95/1.44 % SZS output start Refutation 0.95/1.44 0.95/1.44 % Proof 1 at 0.24 (+ 0.01) seconds. 0.95/1.44 % Length of proof is 13. 0.95/1.44 % Level of proof is 5. 0.95/1.44 % Maximum clause weight is 9.000. 0.95/1.44 % Given clauses 172. 0.95/1.44 0.95/1.44 4 (all Ax all C ((exists I1 model(I1,Ax)) & (exists I2 -model(I2,Ax)) & (all I3 model(I3,C)) <-> status(Ax,C,wtc))) # label(wtc) # label(axiom) # label(non_clause). [assumption]. 0.95/1.44 9 (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.95/1.44 25 (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.95/1.44 38 status(f44(A,B),f45(A,B),A) | isa(A,B) # label(isa) # label(axiom). [clausify(25)]. 0.95/1.44 39 -status(f44(A,B),f45(A,B),B) | isa(A,B) # label(isa) # label(axiom). [clausify(25)]. 0.95/1.44 40 -isa(wtc,thm) # label(isa_wtc_thm) # label(negated_conjecture). [assumption]. 0.95/1.44 66 model(A,B) | -status(C,B,wtc) # label(wtc) # label(axiom). [clausify(4)]. 0.95/1.44 86 status(A,B,thm) | -model(f22(A,B),B) # label(thm) # label(axiom). [clausify(9)]. 0.95/1.44 146 status(f44(wtc,thm),f45(wtc,thm),wtc). [resolve(40,a,38,b)]. 0.95/1.44 147 -status(f44(wtc,thm),f45(wtc,thm),thm). [resolve(40,a,39,b)]. 0.95/1.44 535 model(A,f45(wtc,thm)). [resolve(146,a,66,b)]. 0.95/1.44 1465 status(A,f45(wtc,thm),thm). [resolve(535,a,86,b)]. 0.95/1.44 1466 $F. [resolve(1465,a,147,a)]. 0.95/1.44 0.95/1.44 % SZS output end Refutation 0.95/1.44 ============================== end of proof ========================== 0.95/1.44 0.95/1.44 ============================== STATISTICS ============================ 0.95/1.44 0.95/1.44 Given=172. Generated=1886. Kept=1416. proofs=1. 0.95/1.44 Usable=172. Sos=1195. Demods=0. Limbo=25, Disabled=146. Hints=0. 0.95/1.44 Megabytes=2.50. 0.95/1.44 User_CPU=0.24, System_CPU=0.01, Wall_clock=0. 0.95/1.44 0.95/1.44 ============================== end of statistics ===================== 0.95/1.44 0.95/1.44 ============================== end of search ========================= 0.95/1.44 0.95/1.44 THEOREM PROVED 0.95/1.44 % SZS status Theorem 0.95/1.44 0.95/1.44 Exiting with 1 proof. 0.95/1.44 0.95/1.44 Process 23208 exit (max_proofs) Tue Aug 9 02:57:50 2022 0.95/1.44 Prover9 interrupted 0.95/1.44 EOF