0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : vampire --mode casc_sat -m 90000 -t %d %s 0.02/0.23 % Computer : n155.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 04:20:10 CDT 2018 0.02/0.23 % CPUTime : 0.02/0.24 Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem! 0.02/0.24 % remaining time: 3000 next slice time: 3 0.02/0.27 dis+11_5_cond=fast:er=known:fsr=off:fde=unused:gs=on:gsssp=full:nm=0:nwc=1:sas=minisat:sac=on:sdd=large:sser=off:sfr=on:ssfp=40000:ssfq=1.1:ssnc=none:sp=occurrence_1 on theBenchmark 0.43/0.66 % (20488)Time limit reached! 0.43/0.66 % ------------------------------ 0.43/0.66 % Version: Vampire 4.1 for CASC J8 Entry 0.43/0.66 % Termination reason: Time limit 0.43/0.66 % Termination phase: Saturation 0.43/0.66 0.43/0.66 % Memory used [KB]: 11129 0.43/0.66 % Time elapsed: 0.400 s 0.43/0.66 % ------------------------------ 0.43/0.66 % ------------------------------ 0.43/0.67 % remaining time: 2995 next slice time: 81 0.43/0.67 fmb+10_1_sas=minisat_77 on theBenchmark 0.43/0.67 TRYING [1] 0.43/0.67 TRYING [2] 0.43/0.67 TRYING [3] 0.43/0.68 TRYING [4] 0.48/0.71 Finite Model Found! 0.48/0.71 % SZS status CounterSatisfiable for theBenchmark 0.48/0.71 Satisfiable! 0.48/0.71 % SZS output start FiniteModel for theBenchmark 0.48/0.71 tff(declare$i,type,$i:$tType). 0.48/0.71 tff(declare_$i1,type,n0:$i). 0.48/0.71 tff(declare_$i2,type,n:$i). 0.48/0.71 tff(declare_$i3,type,fmb_$i_3:$i). 0.48/0.71 tff(declare_$i4,type,fmb_$i_4:$i). 0.48/0.71 tff(finite_domain,axiom, 0.48/0.71 ! [X:$i] : ( 0.48/0.71 X = n0 | X = n | X = fmb_$i_3 | X = fmb_$i_4 0.48/0.71 ) ). 0.48/0.71 0.48/0.71 tff(distinct_domain,axiom, 0.48/0.71 n0 != n & n0 != fmb_$i_3 & n0 != fmb_$i_4 & n != fmb_$i_3 & n != fmb_$i_4 & 0.48/0.71 fmb_$i_3 != fmb_$i_4 0.48/0.71 ). 0.48/0.71 0.48/0.71 tff(declare_perm,type,perm: $i > $i). 0.48/0.71 tff(function_perm,axiom, 0.48/0.71 perm(n0) = n 0.48/0.71 & perm(n) = n 0.48/0.71 & perm(fmb_$i_3) = n 0.48/0.71 & perm(fmb_$i_4) = fmb_$i_4 0.48/0.71 0.48/0.71 ). 0.48/0.71 0.48/0.71 tff(declare_p,type,p: $i > $i). 0.48/0.71 tff(function_p,axiom, 0.48/0.71 p(n0) = n0 0.48/0.71 & p(n) = n 0.48/0.71 & p(fmb_$i_3) = fmb_$i_4 0.48/0.71 & p(fmb_$i_4) = fmb_$i_4 0.48/0.71 0.48/0.71 ). 0.48/0.71 0.48/0.71 tff(declare_q,type,q: $i > $i). 0.48/0.71 tff(function_q,axiom, 0.48/0.71 q(n0) = n 0.48/0.71 & q(n) = n 0.48/0.71 & q(fmb_$i_3) = n 0.48/0.71 & q(fmb_$i_4) = fmb_$i_4 0.48/0.71 0.48/0.71 ). 0.48/0.71 0.48/0.71 tff(declare_minus,type,minus: $i * $i > $i). 0.48/0.71 tff(function_minus,axiom, 0.48/0.71 minus(n0,n0) = fmb_$i_4 0.48/0.71 & minus(n0,n) = fmb_$i_4 0.48/0.71 & minus(n0,fmb_$i_3) = fmb_$i_4 0.48/0.71 & minus(n0,fmb_$i_4) = n 0.48/0.71 & minus(n,n0) = fmb_$i_4 0.48/0.71 & minus(n,n) = fmb_$i_4 0.48/0.71 & minus(n,fmb_$i_3) = fmb_$i_4 0.48/0.71 & minus(n,fmb_$i_4) = n 0.48/0.71 & minus(fmb_$i_3,n0) = fmb_$i_4 0.48/0.71 & minus(fmb_$i_3,n) = fmb_$i_4 0.48/0.71 & minus(fmb_$i_3,fmb_$i_3) = fmb_$i_4 0.48/0.71 & minus(fmb_$i_3,fmb_$i_4) = n 0.48/0.71 & minus(fmb_$i_4,n0) = n 0.48/0.71 & minus(fmb_$i_4,n) = n 0.48/0.71 & minus(fmb_$i_4,fmb_$i_3) = n 0.48/0.71 & minus(fmb_$i_4,fmb_$i_4) = fmb_$i_4 0.48/0.71 0.48/0.71 ). 0.48/0.71 0.48/0.71 tff(declare_plus,type,plus: $i * $i > $i). 0.48/0.71 tff(function_plus,axiom, 0.48/0.71 plus(n0,n0) = n0 0.48/0.71 & plus(n0,n) = n0 0.48/0.71 & plus(n0,fmb_$i_3) = n0 0.48/0.71 & plus(n0,fmb_$i_4) = fmb_$i_4 0.48/0.71 & plus(n,n0) = n0 0.48/0.71 & plus(n,n) = n0 0.48/0.71 & plus(n,fmb_$i_3) = n0 0.48/0.71 & plus(n,fmb_$i_4) = fmb_$i_4 0.48/0.71 & plus(fmb_$i_3,n0) = n0 0.48/0.71 & plus(fmb_$i_3,n) = n0 0.48/0.71 & plus(fmb_$i_3,fmb_$i_3) = n0 0.48/0.71 & plus(fmb_$i_3,fmb_$i_4) = fmb_$i_4 0.48/0.71 & plus(fmb_$i_4,n0) = fmb_$i_4 0.48/0.71 & plus(fmb_$i_4,n) = fmb_$i_4 0.48/0.71 & plus(fmb_$i_4,fmb_$i_3) = fmb_$i_4 0.48/0.71 & plus(fmb_$i_4,fmb_$i_4) = n0 0.48/0.71 0.48/0.71 ). 0.48/0.71 0.48/0.71 tff(declare_s,type,s: $i > $i). 0.48/0.71 tff(function_s,axiom, 0.48/0.71 s(n0) = fmb_$i_3 0.48/0.71 & s(n) = fmb_$i_4 0.48/0.71 & s(fmb_$i_3) = n 0.48/0.71 & s(fmb_$i_4) = fmb_$i_4 0.48/0.71 0.48/0.71 ). 0.48/0.71 0.48/0.71 tff(queens_q_definition,axiom,~queens_q). 0.48/0.71 tff(queens_p_definition,axiom,queens_p). 0.48/0.71 tff(declare_le,type,le: $i * $i > $o ). 0.48/0.71 fof(predicate_le,axiom, 0.48/0.71 le(n0,n0) 0.48/0.71 & le(n0,n) 0.48/0.71 & le(n0,fmb_$i_3) 0.48/0.71 & le(n0,fmb_$i_4) 0.48/0.71 & ~le(n,n0) 0.48/0.71 & le(n,n) 0.48/0.71 & ~le(n,fmb_$i_3) 0.48/0.71 & le(n,fmb_$i_4) 0.48/0.71 & ~le(fmb_$i_3,n0) 0.48/0.71 & le(fmb_$i_3,n) 0.48/0.71 & le(fmb_$i_3,fmb_$i_3) 0.48/0.71 & le(fmb_$i_3,fmb_$i_4) 0.48/0.71 & ~le(fmb_$i_4,n0) 0.48/0.71 & ~le(fmb_$i_4,n) 0.48/0.71 & ~le(fmb_$i_4,fmb_$i_3) 0.48/0.71 & le(fmb_$i_4,fmb_$i_4) 0.48/0.71 0.48/0.71 ). 0.48/0.71 0.48/0.71 tff(declare_lt,type,lt: $i * $i > $o ). 0.48/0.71 fof(predicate_lt,axiom, 0.48/0.71 lt(n0,n0) 0.48/0.71 & lt(n0,n) 0.48/0.71 & lt(n0,fmb_$i_3) 0.48/0.71 & lt(n0,fmb_$i_4) 0.48/0.71 & lt(n,n0) 0.48/0.71 & lt(n,n) 0.48/0.71 & lt(n,fmb_$i_3) 0.48/0.71 & lt(n,fmb_$i_4) 0.48/0.71 & lt(fmb_$i_3,n0) 0.48/0.71 & lt(fmb_$i_3,n) 0.48/0.71 & lt(fmb_$i_3,fmb_$i_3) 0.48/0.71 & lt(fmb_$i_3,fmb_$i_4) 0.48/0.71 & lt(fmb_$i_4,n0) 0.48/0.71 & lt(fmb_$i_4,n) 0.48/0.71 & lt(fmb_$i_4,fmb_$i_3) 0.48/0.71 & lt(fmb_$i_4,fmb_$i_4) 0.48/0.71 0.48/0.71 ). 0.48/0.71 0.48/0.71 % SZS output end FiniteModel for theBenchmark 0.48/0.71 % ------------------------------ 0.48/0.71 % Version: Vampire 4.1 for CASC J8 Entry 0.48/0.71 % Termination reason: Satisfiable 0.48/0.71 0.48/0.71 % Memory used [KB]: 1535 0.48/0.71 % Time elapsed: 0.045 s 0.48/0.71 % ------------------------------ 0.48/0.71 % ------------------------------ 0.48/0.71 % Success in time 0.476 s 0.48/0.72 EOF